The following pages link to (Q4283227):
Displaying 18 items.
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- On partial and paraconsistent logics (Q701297) (← links)
- Proof compressions with circuit-structured substitutions (Q843604) (← links)
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel). (Q930260) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- The undecidability of \(k\)-provability (Q1176199) (← links)
- Turning cycles into spirals (Q1295442) (← links)
- Generalizing theorems in real closed fields (Q1899140) (← links)
- Physics and proof theory (Q2249005) (← links)
- Structure of proofs and the complexity of cut elimination (Q2368983) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- (Q3490999) (← links)
- Input Proofs and Rank One Cutting Planes (Q4018154) (← links)
- (Q4281686) (← links)
- Towards structurally-free theorem proving (Q4392659) (← links)
- Semialgebraic Proofs and Efficient Algorithm Design (Q5215904) (← links)
- (Q5219931) (← links)
- Biconsequence relations: A four-valued formalism of reasoning with inconsistency and incompleteness (Q5937806) (← links)