Skip to main content

Partition relations in arithmetic

Part of the Lecture Notes in Mathematics book series (LNM,volume 1130)

Keywords

  • Initial Segment
  • Atomic Formula
  • Springer Lecture Note
  • Peano Arithmetic
  • Partition Relation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (Canada)
  • Compact, lightweight 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

  1. BENNETT,J.H. On spectra, Ph.D. dissertation, Princeton University (1962).

    Google Scholar 

  2. CLOTE, P. Anti-basis theorems and their relation to independence results in Peano Arithmetic, in Model Theory and Arithmetic, Springer Lecture Notes in Mathematics 890(1980) pp. 115–133.

    CrossRef  MathSciNet  Google Scholar 

  3. DIMITRACOPOULOS, C. Matijasevic’s theorem and fragments of arithmetic, Ph.D. Dissertation, University of Manchester, (1980).

    Google Scholar 

  4. FRIEDMAN, H. On fragments of Peano arithmetic, preprint.

    Google Scholar 

  5. ____ Systems of second order arithmetic with restricted induction. (Abstract) J.Symbolic Logic 41(1976) pp. 557–559.

    CrossRef  Google Scholar 

  6. JOCKUSCH, C.G. Jr. Ramsey’s theorem and recursion theory. J.Symbolic Logic 37, (1972), pp. 268–280.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. JOCKUSCH, G.G. Jr. & SOARE, R.I. П 01 classes and degrees of theories. Transactions of Am.Math.Soc. 173(1972) pp. 33–56.

    MathSciNet  MATH  Google Scholar 

  8. KAUFMANN, M. On existence of Σn end extensions. Logic Year 1979–80, Springer Lecture Notes in Mathematics, 859(1980) pp. 92–103.

    CrossRef  MathSciNet  Google Scholar 

  9. MILLS, G. & PARIS, J. Regularity in models of arithmetic. J. Symbolic Logic, 49, No 1 (1984), pp. 272–280.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. KIRBY, L. Ultrafilters and types on models of arithmetic. Preprint.

    Google Scholar 

  11. KIRBY, L. & PARIS, J. Σn-collection schemas in arithmetic. Logic Colloquium 77, pp. 199–209, North-Holland Publishing Co., (1978).

    MathSciNet  MATH  Google Scholar 

  12. KRANAKIS, E. Parition and reflection properties of admissible ordinals. Annals of Mathematical Logic 22(1982), pp. 213–242.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. ____ Stepping up lemmas in definable partitions. J. Symbolic Logic 49,No1, (1984), pp. 22–31.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. PARIS, J. Some conservation results for fragments of arithmetic, in: Model Theory and Arithmetic, Springer Lecture Notes in Mathematics, No 890 (1980) pp. 251–262.

    Google Scholar 

  15. PINO, R. Πn-collection, indicatrices et ultrafiltres définissables. Thèse de 3ocycle, Université Paris VII (1983).

    Google Scholar 

  16. PUTNAM, H. Trial and error predicates and the solution to a problem of Mostowski, J. Symbolic Logic, 30 (1965), pp. 49–57.

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. WOODS, A.R. Some problems in logic and number theory, Ph.D. dissertation, University of Manchester (1981).

    Google Scholar 

  18. WRATHALL, C. Rudimentary predicates and relative computation, SIAM J. Comput. 7 (1976), pp. 194–209.

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. HAY, L. MANASTER, A. & ROSENSTEIN, J. Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy, Annals of Math.Logic, 8(1975), pp. 297–343.

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. PARIS, J. A hierarchy of cuts in models of arithmetic, in Model Theory of Algebra and Arithmetic, Springer Lecture Notes in Mahtematics, No 834, pp. 312–337.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Clote, P. (1985). Partition relations in arithmetic. In: Di Prisco, C.A. (eds) Methods in Mathematical Logic. Lecture Notes in Mathematics, vol 1130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0075306

Download citation

  • DOI: https://doi.org/10.1007/BFb0075306

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15236-1

  • Online ISBN: 978-3-540-39414-3

  • eBook Packages: Springer Book Archive