The following pages link to On induction-free provability (Q1353982):
Displaying 9 items.
- Preservation theorems and restricted consistency statements in bounded arithmetic (Q598285) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- Simulating non-prenex cuts in quantified propositional calculus (Q3096088) (← links)
- (Q3140642) (← links)
- Examining Fragments of the Quantified Propositional Calculus (Q3617380) (← links)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
- Restricted polynomial induction versus ordinary induction (Q4565103) (← links)
- Restricted polynomial induction versus parameter free ordinary induction (Q5066172) (← links)
- Fragments of bounded arithmetic and the lengths of proofs (Q5502825) (← links)
