The following pages link to Cut Elimination In Situ (Q5361251):
Displaying 24 items.
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- Cut formulas in propositional logic (Q689298) (← links)
- Corrected upper bounds for free-cut elimination (Q719283) (← links)
- Cut elimination for S4C: A case study (Q817705) (← links)
- Proof compressions with circuit-structured substitutions (Q843604) (← links)
- Transductions in arithmetic (Q904144) (← links)
- On the form of witness terms (Q982183) (← links)
- Describing proofs by short tautologies (Q1023053) (← links)
- Don't eliminate cut (Q1057847) (← links)
- Cut elimination and automatic proof procedures (Q1183598) (← links)
- Cut normal forms and proof complexity (Q1302302) (← links)
- Herbrand's theorem as higher order recursion (Q1987218) (← links)
- Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) (Q2144618) (← links)
- The arithmetics of a theory (Q2345393) (← links)
- Interpretability degrees of finitely axiomatized sequential theories (Q2436609) (← links)
- Cuts and gluts (Q3647229) (← links)
- Cut Elimination in the Presence of Axioms (Q4254567) (← links)
- (Q4489070) (← links)
- The cost of a cycle is a square (Q4532599) (← links)
- (Q5098254) (← links)
- The small‐is‐very‐small principle (Q5108874) (← links)
- The Interpretation Existence Lemma (Q5214783) (← links)
- Elementary elimination of prenex cuts in disjunction-free intuitionistic logic (Q5351952) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023 (Q6613397) (← links)
