Skip to main content

Phase Transitions Related to the Pigeonhole Principle

  • Conference paper
Language, Life, Limits (CiE 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8493))

Included in the following conference series:

  • 716 Accesses

Abstract

Since Jeff Paris introduced them in the late seventies [Par78], densities turned out to be useful for studying independence results. Motivated by their simplicity and surprising strength we investigate the combinatorial complexity of two such densities which are strongly related to the pigeonhole principle. The aim is to miniaturise Ramsey’s Theorem for 1-tuples. The first principle uses an unlimited amount of colours, whereas the second has a fixed number of two colours. We show that these principles give rise to Ackermannian growth. After parameterising these statements with respect to a function f : ℕ → ℕ, we investigate for which functions f Ackermannian growth is still preserved.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. De Smet, M., Weiermann, A.: Phase Transitions for Weakly Increasing Sequences. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 168–174. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. De Smet, M.: Unprovability and phase transitions in Ramsey theory. PhD thesis, Ghent (2011)

    Google Scholar 

  3. Hirst, J.L.: Combinatorics in subsystems of second-order arithmetic. PhD thesis, Pennsylvania State University (1987)

    Google Scholar 

  4. Kojman, M., Lee, G., Omri, E., Weiermann, A.: Weiermann: Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. JCT A. 115(6), 1036–1055 (2008)

    MATH  MathSciNet  Google Scholar 

  5. Omri, E., Weiermann, A.: Classifying the phase transition threshold for Ackermannian functions. Ann. Pure Appl. Logic 158(3), 156–162 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  6. Weiermann, A., Hoof, W.V.: Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension. Proc. Amer. Math. Soc. 140(8), 2913–2927 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  7. Paris, J.B.: Some independence results for Peano arithmetic. J. Symbolic Logic 43(4), 725–731 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

De Smet, M., Weiermann, A. (2014). Phase Transitions Related to the Pigeonhole Principle. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08019-2_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08018-5

  • Online ISBN: 978-3-319-08019-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics