Skip to main content Accessibility help


  • PHILIP D. WELCH (a1)


The use of Extended Logics to replace ordinary second order definability in Kleene’s Ramified Analytical Hierarchy is investigated. This mirrors a similar investigation of Kennedy, Magidor and Väänänen [11] where Gödel’s universe L of constructible sets is subjected to similar variance. Enhancing second order definability allows models to be defined which may or may not coincide with the original Kleene hierarchy in domain. Extending the logic with game quantifiers, and assuming strong axioms of infinity, we obtain minimal correct models of analysis. A wide spectrum of models can be so generated from abstract definability notions: one may take an abstract Spector Class and extract an extended logic for it. The resultant structure is then a minimal model of the given kind of definability.



Hide All
[1]Aczel, P., Quantifiers, games and inductive definitions, Proceedings of the Third Scandinavian Logic Symposium (University of Uppsala, Uppsala, 1973) (Kanger, S., editor), Studies in Logic and the Foundations of Mathematics, vol. 82, North-Holland, Amsterdam, 1975, pp. 114.
[2]Boolos, G. and Putnam, H., Degrees of unsolvability of constructible sets of integers. The Journal for Symbolic Logic, vol. 33 (1968), pp. 497513.
[3]Boyd, R., Hensel, G., and Putnam, H., A recursion-theoretic characterization of the ramified analytical hierarchy. Transactions of the American Mathematical Society, vol. 141 (1966), pp. 3762.
[4]Cohen, P., A minimal model for set theory. Bulletin of the American Mathematical Society, vol. 69 (1963), pp. 537540.
[5]Enderton, H. and Friedman, H., Approximating the standard model of analysis. Fundamenta Mathematicae, vol. 72 (1971), no. 2, pp. 175188.
[6]Friedman, H., Higher set theory and mathematical practice. Annals of Mathematical Logic, vol. 2 (1970), no. 3, pp. 325327.
[7]Kechris, A., Martin, D. A., and Solovay, R., Introduction to Q-theory, Cabal Seminar 81–85 (Kechris, A., Martin, D. A., and Moschovakis, Y., editors), Lecture Notes in Mathematics, vol. 1333, Springer Verlag, Berlin, 1988, pp. 199281.
[8]Kechris, A. S., On Spector classes, Cabal Seminar 76–77 (Kechris, A. S. and Moschovakis, Y. N., editors), Lecture Notes in Mathematics Series, vol. 689, Springer, Berlin, 1978, pp. 245278.
[9]Kennedy, J., On formalism freeness: Implementing Gödel’s 1946 princeton bicentennial lecture, this Bulletin, vol. 19 (2013), no. 3, pp. 351393.
[10]Kennedy, J., Turing, Gödel and the “Bright Abyss”. Boston Studies in Philosophy and History of Science, vol. 324 (2017), pp. 6391.
[11]Kennedy, J., Magidor, M., and Väänänen, J., Inner models from extended logics. Isaac Newton Preprint Series, vol. NI 16006 (2016), pp. 175.
[12]Kleene, S. C., Recursive quantifiers and functionals of finite type I. Transactions of the American Mathematical Society, vol. 91 (1959), pp. 152.
[13]Moschovakis, Y. N., Uniformization in a playful universe. Bulletin of the American Mathematical Society, vol. 77 (1971), pp. 731736.
[14]Moschovakis, Y. N., Elementary Induction on Abstract Structures, Studies in Logic Series, vol. 77, North-Holland, Amsterdam, 1974.
[15]Moschovakis, Y. N., Descriptive Set Theory, Studies in Logic Series, North-Holland, Amsterdam, 2009.
[16]Shilleto, J. R., Minimum models of analysis. Journal for Symbolic Logic, vol. 37 (1972), no. 1, pp. 4854.
[17]Simpson, S., Subsystems of Second Order Arithmetic, Perspectives in Mathematical Logic, Springer, Berlin, 1999.
[18]Steel, J. R., Projectively well-ordered inner models. Annals of Pure and Applied Logic, vol. 74 (1995), no. 1, pp. 77104.
[19]Welch, P. D., Weak systems of determinacy and arithmetical quasi-inductive definitions. The Journal for Symbolic Logic, vol. 76 (2011), no. 2, pp. 418436.
[20]Welch, P. D., Gδσ-games and generalized computation. Unpublished manuscript. Available at∼mapdw/Sigma0-3-IJ-Sep-2016.pdf.



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed