Comparing incomparable kleene degrees

DOI10.2307/2273788MaRDI QIDQ3708791zbMATH OpenOpenAlexFDO

Authors Philip D. Welch

Publication date 1985

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

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

zbMATH Keywords

class forcingdeterminacyFriedman setincomparabilityKleene reducibilityset of reals coding well founded trees of admissible heightsharps

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65) Descriptive set theory (03E15) Consistency and independence results (03E35) Determinacy principles (03E60) Other set-theoretic hypotheses and axioms (03E65)

Recommendations

• On the Kleene degrees of Π₁¹ sets
• Forcing and reducibilities. III. Forcing in fragments of set theory
• A new proof of Friedman's conjecture
• Turing incomparability in Scott sets
• A measure-theoretic proof of Turing incomparability

Cited in

(3)

• On the Kleene degrees of Π₁¹ sets
• A new proof of Friedman's conjecture
• Turing incomparability in Scott sets

This page was built for publication: Comparing incomparable kleene degrees

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