On end-extensions of models of ¬exp

Mathematical Logic Quarterly

Volumn 42, Issue 1, 1996, Pages 1-18

  Ferreira, Fernando ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

AC0; Bounded arithmetic; Bounded collection; Computational complexity; I 0

Indexed keywords

EID: 0030304729     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.19960420102     Document Type: Article

References (19)

1. 1-formulas on finite structures. Ann. Pure Appl. Logic 24 (1983), 1-24.
2. BUSS, S. R., Bounded Arithmetic. Ph. D. Dissertation, Princeton University, 1985. A revision of this thesis was published by Bibliopolis in 1986.
3. CLOTE, P., and G. TAKEUTI, First order bounded arithmetic and small Boolean circuit complexity classes. In: Feasible Mathematics II (P. CLOTE and J. REMMEL, eds.), Birkhäuser-Verlag, Basel-Boston-Berlin 1995, pp. 154-218.
4. FERREIRA, F., Polynomial Time Computable Arithmetic and Conservative Extensions. Ph. D. Dissertation, Pennsylvania State University, 1988.
5. FERREIRA, F., On End Extensions of Models of ¬exp. Preprint, CMAF 22/91, Lisboa 1991.
6. FERREIRA, F., Binary models generated by their tally part. Archive Math. Logic 33 (1994), 283-289.
7. FERREIRA, F., Some notes on subword quantification and induction thereof. To appear in: Logic and Algebra in Memory of Roberto Megari.
8. HÁJEK, P., and P. PUDLÁK, Metamathematics of First-Order Arithmetic. Perspectives in Mathematical Logic, Springer-Verlag, Berlin-Heidelberg-New York 1993.
9. HÅSTAD, J., Computational Limitations for Small Depth Circuits. Ph. D. Dissertation, Massachussetts Institute of Technology, 1986.
10. IMMERMAN, N., Descriptive and computational complexity. In: Computational Complexity Theory (J. HARTMANIS, ed.), AMS Short Course Lecture Notes 38, American Mathematical Society, Providence, R. I., 1989, pp. 75-91.
11. KAYE, R., Models of Peano Arithmetic. Oxford Logic Guides 15, Clarendon Press, Oxford 1991.
12. KRAJÍČEK, J., Exponentiation and second order bounded arithmetic. Ann. Pure Appl. Logic 48 (1990), 261-276.
13. n-collection schema in arithmetic. In: Logic Coloquium 1977, Studies in Logic and the Foundations of Mathematics (A. MACINTYRE et al., eds.), North-Holland Publ. Comp., Amsterdam 1978, pp. 199-209.
14. RAZBOROV, A., An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic. In: Arithmetic, Proof Theory, and Computational Complexity (P. CLOTE and J. KRAJÍČEK, eds.), Oxford Logic Guides 23, Oxford University Press 1993, pp. 247-277.
15. TAKEUTI, G., RSUV isomorphisms. In: Arithmetic, Proof Theory, and Computational Complexity (P. CLOTE and J. KRAJÍČEK, eds.), Oxford Logic Guides 23, Oxford University Press 1993, pp. 364-386.
16. WILKIE, A. J., Modèles nonstandard de l'arithmétique et complexité algorithmique. In: Modèles non standard en arithmétique et théorie des ensembles (J. RESSAYRE and A. WILKIE, eds.), Publ. Math. l'Université Paris VII 22 (1987), pp. 5-45.
17. WILKIE, A. J. and J. B. PARIS, On the existence of end extensions of models of bounded induction. In: Logic, Methodology and Philosophy of Science VIII (J. E. FENSTAD et al., eds.), Elsevier Science Publishers, Amsterdam 1989, pp. 143-161.
18. WILKIE, A. J., and J. B. PARIS, On the scheme of induction for bounded arithmetic formulas. Ann. Pure Appl. Logic 35 (1987), 261-302.
19. ZAMBELLA, D., Chapters in Bounded Arithmetic and Provability Logic. Ph. D. Dissertation, Universiteit van Amsterdam, 1994.