THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS

DOI10.1017/bsl.2018.69OpenAlexW2885065647MaRDI QIDQ4961868

Philip D. Welch

Publication date: 26 October 2018

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.03814

zbMATH Keywords

definabilitydeterminacyanalytical hierarchy

Mathematics Subject Classification ID

Descriptive set theory (03E15) Determinacy principles (03E60) Other notions of set-theoretic definability (03E47)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elementary induction on abstract structures
• Cabal seminar 76-77. Proceedings, Caltech-UCLA logic seminar 1976-77
• Projectively well-ordered inner models
• On formalism freeness: Implementing Gödel's 1946 Princeton bicentennial lecture
• Weak systems of determinacy and arithmetical quasi-inductive definitions
• Recursive Functionals and Quantifiers of Finite Types I
• A minimal model for set theory
• Degrees of unsolvability of constructible sets of integers
• A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy
• Higher set theory and mathematical practice
• Uniformization in a playful universe
• Approximating the standard model of analysis
• Minimum models of analysis

This page was built for publication: THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS