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

(18)

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

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)