Pages that link to "Item:Q1302302"
From MaRDI portal
The following pages link to Cut normal forms and proof complexity (Q1302302):
Displaying 17 items.
- On the computational complexity of cut-reduction (Q636310) (← links)
- CERES: An analysis of Fürstenberg's proof of the infinity of primes (Q944367) (← links)
- Describing proofs by short tautologies (Q1023053) (← links)
- Structure of proofs and the complexity of cut elimination (Q2368983) (← links)
- Towards a clausal analysis of cut-elimination (Q2457341) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Herbrand's theorem and term induction (Q2491080) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- On the complexity of proof deskolemization (Q2892685) (← links)
- A Clausal Approach to Proof Analysis in Second-Order Logic (Q3605531) (← links)
- (Q4362908) (← links)
- 2000 Annual Meeting of the Association for Symbolic Logic (Q4527937) (← links)
- UNSOUND INFERENCES MAKE PROOFS SHORTER (Q4628675) (← links)
- Expansion trees with cut (Q5236547) (← links)
- Proof Transformations and Structural Invariance (Q5426006) (← links)
- Herbrand Sequent Extraction (Q5505525) (← links)
- Cut-elimination and redundancy-elimination by resolution (Q5927981) (← links)