Forcing and reducibilities

DOI10.2307/2273547zbMath0526.03025OpenAlexW2127627097MaRDI QIDQ3041177

Piergiorgio Odifreddi

Publication date: 1983

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

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

zbMATH Keywords

Turing degreesSacks forcingarithmetical degreesforcing in arithmeticarithmetic setsFeferman forcingn-generic set

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

An oracle builder's toolkit ⋮ ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES ⋮ A Suppes predicate for general relativity and set-theoretically generic spacetimes ⋮ Partially definable forcing and bounded arithmetic ⋮ Degrees of Dowd-type generic oracles ⋮ Complexity of the \(r\)-query tautologies in the presence of a generic oracle

Cites Work

• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• On degrees of unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Reducibility orderings: Theories, definability and automorphisms
• Transfinite extensions of Friedberg's completeness criterion
• Some applications of forcing to hierarchy problems in arithmetic
• THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS