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).
Similar content being viewed by others
References
Avigad, J: On the relationships between ATR 0 and \({\widehat{\it ID}_{ < \omega}}\). J. Symb. Log. 61(3d), 768–779 (1996)
Feferman, S: Operational set theory and small large cardinals. Inf. Comput. 207(10), 971–979 (2009)
Feferman, S.: Is the Continuum Hypothesis a definite mathematical problem? http://math.stanford.edu/~feferman/papers/IsCHdefinite.pdf. Accessed 2014
Flumini, D., Sato, K.: From hierarchy to well-foundedness. Arch. Math. Log. (2014). doi:10.1007/s00153-014-0392-9
Fujimoto, K: Classes and truths in set theory. Ann. Pure Appl. Log. 163(11), 1484–1523 (2012)
Jäger, G: Full operational set theory with unbounded existential quantification and power set. Ann. Pure Appl. Log. 161(1), 33–52 (2009)
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)
Jäger, G, Strahm, T: Fixed point theories and dependent choice. Arch. Math. Log. 39(7), 493–508 (2000)
Krähenbühl, J.: On the relationship between choice schemes and iterated class comprehension in set theory. Ph.D. Thesis, Universität Bern (2011)
Kunen, K.: Set Theory: An Introduction to Independent Proofs. Elsevier, Amsterdam (1980)
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)
Moschovakis, Y.: Elementary Introduction on Abstract Structures. North Holland, Amsterdam (1974)
Nemoto, T: Determinacy of Wadge classes and subsystems of second order arithmetic. Math. Log. Q 55(2), 154–176 (2009)
Sato, K: The strength of extensionality I: weak weak set theories with infinity. Ann. Pure Appl. Log. 157(2–3), 234–268 (2009)
Sato, K: The strength of extensionality II: weak set theories without infinity. Ann. Pure Appl. Log. 162(8), 579–646 (2011)
Sato, K.: The strength of extensionality III: weak weak set theories with higher infinite (in preparation)
Sato, K.: Relative predicativity and dependent recursion in second-order set theory and higher-order theories. J. Symb. Log. 79, 712–732 (2014)
Simspon, S.: Subsystems of Second Order Arithmetic. Springer, Berlin (1999)
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)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by Hasler Foundation.
Rights and permissions
About this article
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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-014-0403-x
Keywords
- Subsystems of Morse–Kelley set theory
- Von Neumann–Bernays–Gödel set theory
- Higher order number theory
- Elementarity of well-foundedness
- Proof-theoretic strength