Forcing and reducibilities

DOI10.2307/2273547MaRDI QIDQ3041177zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3241254 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On degrees of recursive unsolvability
• On degrees of unsolvability
• Reducibility orderings: Theories, definability and automorphisms
• Some applications of forcing to hierarchy problems in arithmetic
• THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• The upper semi-lattice of degrees of recursive unsolvability
• Transfinite extensions of Friedberg's completeness criterion

Cited in

(7)

• Degrees of Dowd-type generic oracles
• Complexity of the \(r\)-query tautologies in the presence of a generic oracle
• Partially definable forcing and bounded arithmetic
• An oracle builder's toolkit
• A Suppes predicate for general relativity and set-theoretically generic spacetimes
• On the decidability of the \(\Sigma_2\) theories of the arithmetic and hyperarithmetic degrees as uppersemilattices
• Non-tightness in class theory and second-order arithmetic

This page was built for publication: Forcing and reducibilities

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