Skip to main content
Log in

Models of replacement schemes

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Samuel, R.: Buss. Bounded arithmetic. Bibliopolis, Naples, 1986

  2. 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).

    Google Scholar 

  3. Pollett, C.: Structure and definability in general bounded arithmetic theories. English Ann. Pure Appl. Logic 100 (1–3):189–245 (1999)

    Google Scholar 

  4. Ressayre, J. P.: A conservation result for systems of bounded arithmetic. Unpublished manuscript, 1986

  5. Stockmeyer, L. J.: The polynomial-time hierarchy. Theoret. Comput. Sci. 3 (1):1–22 (1977), (1976)

  6. Takeuti, G.: RSUV isomorphisms. In Arithmetic, proof theory, and computational complexity (Prague, 1991), pages 364–386. Oxford Univ. Press, New York, 1993

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eugenio Chinchilla.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-005-0274-2

Keywords

Navigation