The next admissible set
From MaRDI portal
Publication:5645404
DOI10.2307/2271519zbMath0236.02033OpenAlexW2048873161MaRDI QIDQ5645404
Yiannis N. Moschovakis, Jon Barwise, R. O. Gandy
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
Related Items
A non-hyperarithmetical Gödel logic, Computational inductive definability, Descriptive characterizations of computational complexity, Locally hyperarithmetical induction, A few more dissimilarities between second-order arithmetic and set theory, Inductive Definitions and Computability, The Game Quantifier, Bounds on the strength of ordinal definable determinacy in small admissible sets, Barwise: Infinitary Logic and Admissible Sets, TRUTHS, INDUCTIVE DEFINITIONS, AND KRIPKE-PLATEK SYSTEMS OVER SET THEORY, Minimal Covers and Hyperdegrees, The Shoenfield absoluteness lemma, Model theory for \(L_{\infty \omega _ 1}\), The Theory of Countable Analytical Sets, Hanf numbers for fragments of L\(_{\infty \omega}\), GAMES AND REFLECTION IN, A Generalized Kleene-Moschovakis Theorem, THE ORDER OF REFLECTION
Cites Work