Skip to main content

On Σ N -Definability in Arithmetic

  • Chapter
  • 199 Accesses

Part of the book series: Synthese Library ((SYLI,volume 320))

Abstract

Under certain assumptions, the structures K n +1(M ; X) and I n +1 (M ; X) satisfy that

$${K_{n + 1}}\left( {M;X} \right)\;\left| { = I\sum {_n + \;\neg B\sum {_{n + 1}\;and\;{I_{n + 1}}\left( {M;X} \right)\;\left| { = B\sum {_{n + 1} + \neg I\sum {_{n + 1}} } } \right.} } } \right.$$

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Clôte, P. G. (1983). Partition relations in arithmetic. Lecture Notes in Mathematics, 1130: 32–68.

    Article  Google Scholar 

  • Fernández-Margarit, A. and Pérez-Jiménez, M. J. (1994). Maximum schemes in arithmetic. Mathematical Logic Quarterly, 40: 425–430.

    Article  Google Scholar 

  • Graciani, M. C., Pérez-Jiménez, M. J., Romero, A., and Sancho, F. (2000). Initial segment maximal En-definable sets in fragments of arithmetic. The Yearbook of the Kurt Gödel Society. Forthcoming.

    Google Scholar 

  • Hâjek, P. and Pudlâk, P. (1993). Metamathematics of First-Order Arithmetic Springer Verlag.

    Google Scholar 

  • Kaye, R. (1991). Models of Peano Arithmetic, volume XV of Oxford Logic Guides. Clarendon Press, Oxford.

    Google Scholar 

  • Paris, J. and Kirby, L. (1978). En-collection schemas in arithmetic. Logic Colloquium’77, pp. 199–209.

    Google Scholar 

  • Pérez-Jiménez, M. J. (1992). Esquema,s del Mcíximo en la Aritmética. Doctoral Thesis. Universidad de Sevilla.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Borrego-Diaz, J., Fernández-Margarit, A., Pérez-Jimenez, M.J. (2003). On Σ N -Definability in Arithmetic. In: Rojszczak, A., Cachro, J., Kurczewski, G. (eds) Philosophical Dimensions of Logic and Science. Synthese Library, vol 320. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2612-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-2612-2_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-6432-5

  • Online ISBN: 978-94-017-2612-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics