Degrees of unsolvability of constructible sets of integers

DOI10.2307/2271357zbMath0188.32701OpenAlexW2085361497WikidataQ56112782 ScholiaQ56112782MaRDI QIDQ5582332

Hilary Putnam, George Boolos

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

Related Items (22)

The limits of E-recursive enumerability ⋮ A Π¹₁-uniformization principle for reals ⋮ Countable admissible ordinals and hyperdegrees ⋮ Uncountable master codes and the jump hierarchy ⋮ Systems of notations and the ramified analytical hierarchy ⋮ BASIS THEOREMS FOR -SETS ⋮ Syntactical truth predicates for second order arithmetic ⋮ A selection theorem ⋮ Analytic sets having incomparable kleene degrees ⋮ Maximal chains in the Turing degrees ⋮ Constructible models of subsystems of ZF ⋮ Unnamed Item ⋮ THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS ⋮ Putnam’s Constructivization Argument ⋮ AN APPLICATION OF RECURSION THEORY TO ANALYSIS ⋮ Definability in models of set theory ⋮ Minimal Covers and Hyperdegrees ⋮ The Theory of Countable Analytical Sets ⋮ Effective randomness for continuous measures ⋮ Clockability for ordinal Turing machines ⋮ Forcing and reducibilities. III. Forcing in fragments of set theory ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines

Cites Work

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

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