Degrees of unsolvability of constructible sets of integers

DOI10.2307/2271357MaRDI QIDQ5582332zbMATH OpenOpenAlexWikidataFDO

Authors George Boolos, Hilary W. Putnam

Publication date 1968

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

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

zbMATH Keywords

recursion theory, constructive mathematics

Cites work

• A minimal model for set theory
• A note on constructible sets of integers
• Consistency-Proof for the Generalized Continuum-Hypothesis
• Hierarchies of number-theoretic predicates
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)

Cited in

(30)

• The limits of E-recursive enumerability
• Countable admissible ordinals and hyperdegrees
• Clockability for ordinal Turing machines
• The lost melody theorem for infinite time Blum-Shub-Smale machines
• Syntactical truth predicates for second order arithmetic
• Analytic sets having incomparable kleene degrees
• An application of recursion theory to analysis
• Forcing and reducibilities. III. Forcing in fragments of set theory
• Uncountable master codes and the jump hierarchy
• Constructible models of subsystems of ZF
• Definability in models of set theory
• Systems of notations and the ramified analytical hierarchy
• Minimal Covers and Hyperdegrees
• The Theory of Countable Analytical Sets
• Basis theorem for \(\Sigma_2^1\)-sets
• The ramified analytical hierarchy using extended logics
• Reachability for infinite time Turing machines with long tapes
• Putnam's constructivization argument
• A Π¹₁-uniformization principle for reals
• Maximal chains in the Turing degrees
• Effective randomness for continuous measures
• A selection theorem
• On the Weihrauch degree of the additive Ramsey theorem
• Hilbert's tenth problem for term algebras with a substitution operator
• Complemented subsets and Boolean-valued, partial functions
• Defining long words succinctly in FO and MSO
• On the first-order parts of problems in the Weihrauch degrees
• Algorithmically random series
• Ideal presentations and numberings of some classes of effective quasi-Polish spaces
• Lower bounds on () and other properties of -register machines

This page was built for publication: Degrees of unsolvability of constructible sets of integers

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