Abstract
In the context of bounded arithmetic we consider some general replacement schemes and construct models for them. A new proof of a conservation result between and is derived.
Similar content being viewed by others
References
Samuel, R.: Buss. Bounded arithmetic. Bibliopolis, Naples, 1986
Krajíček, J., Pudlák, P., Takeuti, G.: Bounded arithmetic and the polynomial hierarchy. Ann. Pure Appl. Logic, 52 (1–2):143–153, 1991. International Symposium on Mathematical Logic and its Applications (Nagoya 1988).
Pollett, C.: Structure and definability in general bounded arithmetic theories. English Ann. Pure Appl. Logic 100 (1–3):189–245 (1999)
Ressayre, J. P.: A conservation result for systems of bounded arithmetic. Unpublished manuscript, 1986
Stockmeyer, L. J.: The polynomial-time hierarchy. Theoret. Comput. Sci. 3 (1):1–22 (1977), (1976)
Takeuti, G.: RSUV isomorphisms. In Arithmetic, proof theory, and computational complexity (Prague, 1991), pages 364–386. Oxford Univ. Press, New York, 1993
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chinchilla, E. Models of replacement schemes. Arch. Math. Logic 44, 851–867 (2005). https://doi.org/10.1007/s00153-005-0274-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-005-0274-2