Skip to main content

Strengthenings of Harrington’s Principle

  • Chapter
  • First Online:
Incompleteness for Higher-Order Arithmetic

Part of the book series: SpringerBriefs in Mathematics ((BRIEFSMATH))

  • 352 Accesses

Abstract

In this chapter, we examine the large cardinal strength of strengthenings of Harrington’s Principle, \(\mathsf{HP(\varphi )}\) , over \(\mathsf{Z_2}\) and \(\mathsf{Z_3}\) . In Sect. 4.3, we prove that \(\mathsf{Z_2} + \mathsf{HP}(\varphi )\) is equiconsistent with “\(\mathsf{ZFC} + \{\alpha | \varphi (\alpha )\}\) is stationary”. In Sect. 4.5, we prove that \(\mathsf{Z_3} + \mathsf{HP}(\varphi )\) is equiconsistent with “\(\mathsf{ZFC} +\) there exists a remarkable cardinal \(\kappa \) with \(\varphi (\kappa ) + \{\alpha | \varphi (\alpha )\wedge \{\beta <\alpha | \varphi (\beta )\}\) is stationary in \(\alpha \)} is stationary”. As a corollary, \(\mathsf{Z_4}\) is the minimal system of higher-order arithmetic for proving that \(\mathsf{HP}, \mathsf{HP}(\varphi )\), and \(0^{\sharp }\) exists are pairwise equivalent with each other.

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 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.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

Notes

  1. 1.

    r decides \(\dot{f}(n)\) means for some \(x \in V, r\Vdash \dot{f}(n)=\check{x}\).

  2. 2.

    If \(2^{\omega }>\omega _1\), then \(2^{\omega }\) is collapsed to \(\omega _1\) in V[G] where G is \(\mathbb {P}_{S}\) -generic over V.

  3. 3.

    For remarkable cardinal, I refer to Sect. 2.1.3. For definitions of other notions of large cardinals, I refer to Appendix C.

  4. 4.

    In the proof of Theorem 2.8 there was no need for reshaping due to (2.3).

  5. 5.

    Since \(\kappa \) is remarkable in L, we have \(S_{\mu }^{L[H]}\) is stationary. Take \(\theta \) such that \(L[H,G]\models \theta =\omega _2\). Let A be a Namba sequence in \(\theta \). Note that there is no structure \(X\prec \langle L_{\theta }[H,G], A\rangle \) such that X is countable and \(X\in L[H]\). Thus, in L[HG], we have \(S_{\mu }^{L[H]}\) is not stationary.

  6. 6.

    In the proof of Theorem 2.9 there was no need for reshaping at this point due to (2.4).

References

  1. Cheng, Y., Schindler, R.: Harrington’s Principle in higher-order arithmetic. J. Symb. Log. 80(02), 477–489 (2015)

    Article  MathSciNet  Google Scholar 

  2. Harrington, L.A., Baumgartner, J.E., Kleinberg, E.M.: Adding a closed unbounded set. J. Symb. Log. 41, 481–482 (1976)

    Article  MathSciNet  Google Scholar 

  3. Jensen, R.B.: Lecture note on subcomplete forcing and L-forcing. Handwritten notes. https://www.mathematik.hu-berlin.de/~raesch/org/jensen.html

  4. Shelah, S.: Proper and Improper Forcing. Perspectives in Math. Logic. Springer (1998)

    Google Scholar 

  5. Cummings, J.: Iterated forcing and elementary embeddings. In: Foreman, M., Kanamori, A. (Eds.) Chapter 12 in Handbook of Set Theory. Springer, Berlin (2010)

    Google Scholar 

  6. Jensen, R.B.: Iteration Theorems for Subcomplete and Related Forcings. Handwritten notes. https://www.mathematik.hu-berlin.de/~raesch/org/jensen.html

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong Cheng .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Cheng, Y. (2019). Strengthenings of Harrington’s Principle. In: Incompleteness for Higher-Order Arithmetic. SpringerBriefs in Mathematics. Springer, Singapore. https://doi.org/10.1007/978-981-13-9949-7_4

Download citation

Publish with us

Policies and ethics