Skip to main content
Log in

Full and hat inductive definitions are equivalent in NBG

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

Abstract

A new research project has, quite recently, been launched to clarify how different, from systems in second order number theory extending ACA 0, those in second order set theory extending NBG (as well as those in n + 3-th order number theory extending the so-called Bernays−Gödel expansion of full n + 2-order number theory etc.) are. In this article, we establish the equivalence between \({\Delta^1_0\mbox{\bf-LFP}}\) and \({\Delta^1_0\mbox{\bf-FP}}\), which assert the existence of a least and of a (not necessarily least) fixed point, respectively, for positive elementary operators (or between \({\Delta^{n+2}_0\mbox{\bf-LFP}}\) and \({\Delta^{n+2}_0\mbox{\bf-FP}}\)). Our proof also shows the equivalence between ID 1 and \({\widehat{\it ID}_1}\), both of which are defined in the standard way but with the starting theory PA replaced by ZFC (or full n + 2-th order number theory with global well-ordering).

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Avigad, J: On the relationships between ATR 0 and \({\widehat{\it ID}_{ < \omega}}\). J. Symb. Log. 61(3d), 768–779 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Feferman, S: Operational set theory and small large cardinals. Inf. Comput. 207(10), 971–979 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Feferman, S.: Is the Continuum Hypothesis a definite mathematical problem? http://math.stanford.edu/~feferman/papers/IsCHdefinite.pdf. Accessed 2014

  4. Flumini, D., Sato, K.: From hierarchy to well-foundedness. Arch. Math. Log. (2014). doi:10.1007/s00153-014-0392-9

  5. Fujimoto, K: Classes and truths in set theory. Ann. Pure Appl. Log. 163(11), 1484–1523 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Jäger, G: Full operational set theory with unbounded existential quantification and power set. Ann. Pure Appl. Log. 161(1), 33–52 (2009)

    Article  Google Scholar 

  7. Jäger G, Krähenbühl J: \(\Sigma^1_1\) choice in a theory of sets and classes. In: Schindler, R Ways of Proof Theory, pp. 283–314. Ontos Verlag, Frankfurt (2010)

  8. Jäger, G, Strahm, T: Fixed point theories and dependent choice. Arch. Math. Log. 39(7), 493–508 (2000)

    Article  MATH  Google Scholar 

  9. Krähenbühl, J.: On the relationship between choice schemes and iterated class comprehension in set theory. Ph.D. Thesis, Universität Bern (2011)

  10. Kunen, K.: Set Theory: An Introduction to Independent Proofs. Elsevier, Amsterdam (1980)

    Google Scholar 

  11. Louveau, A.: Some results in the Wadge hierarchy of Borel sets. In: Cabal seminar ’79–’81, pp. 28–55, Lecture Notes in Math., 1019, Springer (1983)

  12. Moschovakis, Y.: Elementary Introduction on Abstract Structures. North Holland, Amsterdam (1974)

    Google Scholar 

  13. Nemoto, T: Determinacy of Wadge classes and subsystems of second order arithmetic. Math. Log. Q 55(2), 154–176 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Sato, K: The strength of extensionality I: weak weak set theories with infinity. Ann. Pure Appl. Log. 157(2–3), 234–268 (2009)

    Article  MATH  Google Scholar 

  15. Sato, K: The strength of extensionality II: weak set theories without infinity. Ann. Pure Appl. Log. 162(8), 579–646 (2011)

    Article  MATH  Google Scholar 

  16. Sato, K.: The strength of extensionality III: weak weak set theories with higher infinite (in preparation)

  17. Sato, K.: Relative predicativity and dependent recursion in second-order set theory and higher-order theories. J. Symb. Log. 79, 712–732 (2014)

  18. Simspon, S.: Subsystems of Second Order Arithmetic. Springer, Berlin (1999)

    Google Scholar 

  19. Strahm, T.: Autonomous Fixed Point Progressions and Fixed Point Transfinite Recursion. In: Buss, S., Hajek, P., Pudlak, P. (eds.) Logic Colloquium 98, pp. 449–464 (2000)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kentaro Sato.

Additional information

This research was partially supported by Hasler Foundation.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sato, K. Full and hat inductive definitions are equivalent in NBG . Arch. Math. Logic 54, 75–112 (2015). https://doi.org/10.1007/s00153-014-0403-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-014-0403-x

Keywords

Mathematics Subject Classification

Navigation