The next admissible set

DOI10.2307/2271519zbMATH Open0236.02033OpenAlexW2048873161MaRDI QIDQ5645404FDOQ5645404

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)

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

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)