Ordinal notations and well-orderings in bounded arithmetic

Annals of Pure and Applied Logic

Volumn 120, Issue 1-3, 2003, Pages 197-223

  Beckmann, Arnold ^a   Pollett, Chris ^b   Buss, Samuel R ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

Bounded arithmetic; Fragments of peano arithmetic; Ordinal notations; Polynomial local search; Well foundedness

Indexed keywords

EID: 0037445576     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(02)00066-0     Document Type: Article

References (14)

1. A. Beckmann, Separating fragments of bounded arithmetic, Ph.D. Thesis, University of Münster, 1996.
2. A. Beckmann, Notations for exponentiation, 1999, submitted for publication.
3. S.R. Buss, Bounded arithmetic, bibliopolis, 1986. Revision of 1985 Princeton University Ph.D. Thesis.
4. S.R. Buss, Axiomatizations and conservation results for fragments of bounded arithmetic, in: Logic and Computation, Proc. of a Workshop held Carnegie-Mellon University, 1987, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence, RI, 1990, pp. 57-84.
5. S.R. Buss, J. Krajíček, An application of Boolean complexity to separation problems in bounded arithmetic, Proc. London Math. Soc. 69 (1994) 1-21.
6. S. Feferman, Systems of predicative analysis I, J. Symbolic Logic 29 (1964) 1-30.
7. S. Feferman, Systems of predicative analysis II: Representations of ordinals, J. Symbolic Logic 33 (1968) 193-220.
8. P. Hájek, P. Pudlák, Metamathematics of First-order Arithmetic, Perspectives in Mathematical Logic, Springer, Berlin, 1993.
9. D.S. Johnson, C.H. Papadimitriou, M. Yannakakis, How easy is local search? J. Comput. System Sci. 37 (1988) 79-100.
10. J. Krajíček, Bounded Arithmetic, Propositional Calculus and Complexity Theory, Cambridge University Press, Cambridge, 1995.
11. W. Pohlers, Proof Theory: An Introduction, Lecture Notes in Mathematics, vol. 1409, Springer, Berlin, 1989.
12. K. Schütte, Proof Theory, Grundlehren der mathematischen Wissenschaften, vol. 225, Springer, Berlin, 1977.
13. R. Sommer, Transfinite induction and hierarchies generated by transfinite recursion within Peano arithmetic, Ph.D. Thesis, U.C. Berkeley, 1990.
14. 0, in: P. Clote, J. Krajíček (Eds.), Arithmetic, Proof Theory and Computational Complexity, Oxford University (Clarendon) Press, Oxford, 1993, pp.