Article contents
Fragments of bounded arithmetic and the lengths of proofs
Published online by Cambridge University Press: 12 March 2014
Abstract
We consider the problem whether the theorems of the fragments
form a strictly increasing hierarchy. We shall show a link to some results about the lengths of proofs in predicate logic that supports the conjecture that the hierarchy is strictly increasing.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2008
References
REFERENCES
- 6
- Cited by