The next admissible set

DOI10.2307/2271519MaRDI QIDQ5645404zbMATH OpenOpenAlexFDO

Authors Jon Barwise, R. O. Gandy, Yiannis N. Moschovakis

Publication date 1971

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2271519

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Cites work

• Hierarchies of number-theoretic predicates

Cited in

(19)

• Descriptive characterizations of computational complexity
• Bounds on the strength of ordinal definable determinacy in small admissible sets
• A non-hyperarithmetical Gödel logic
• The Shoenfield absoluteness lemma
• Hanf numbers for fragments of L\(_{\infty \omega}\)
• A few more dissimilarities between second-order arithmetic and set theory
• Minimal Covers and Hyperdegrees
• The Theory of Countable Analytical Sets
• A Generalized Kleene-Moschovakis Theorem
• Barwise: Infinitary Logic and Admissible Sets
• Truths, inductive definitions, and Kripke-Platek systems over set theory
• THE ORDER OF REFLECTION
• Inductive Definitions and Computability
• The Game Quantifier
• GAMES AND REFLECTION IN
• Computational inductive definability
• Locally hyperarithmetical induction
• The metamathematics of separated determinacy
• Model theory for \(L_{\infty \omega _ 1}\)

This page was built for publication: The next admissible set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5645404)