Comparing incomparable kleene degrees

DOI10.2307/2273788zbMath0584.03030OpenAlexW2065011759MaRDI QIDQ3708791

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

incomparabilityclass forcingdeterminacysharpsFriedman setKleene reducibilityset of reals coding well founded trees of admissible height

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item

This page was built for publication: Comparing incomparable kleene degrees