Pages that link to "Item:Q5585410"
From MaRDI portal
The following pages link to Some applications of forcing to hierarchy problems in arithmetic (Q5585410):
Displaying 15 items.
- A note on the enumeration degrees of 1-generic sets (Q283105) (← links)
- Inductive definability: Measure and category (Q1155049) (← links)
- Generic oracles, uniform machines, and codes (Q1184732) (← links)
- The generic oracle hypothesis is false (Q1209320) (← links)
- Some measure theoretic results in effective descriptive set theory (Q1223294) (← links)
- Degrees of Dowd-type generic oracles (Q1854543) (← links)
- Complexity of the \(r\)-query tautologies in the presence of a generic oracle (Q1861135) (← links)
- On the reducibility of \(\Pi_ 1^ 1\) sets (Q2547889) (← links)
- Forcing and reducibilities (Q3041177) (← links)
- An effective selection theorem (Q3328536) (← links)
- Notions of weak genericity (Q3342559) (← links)
- Forcing and reductibilities. II. Forcing in fragments of analysis (Q3691651) (← links)
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers (Q3691653) (← links)
- A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory (Q5108130) (← links)
- Classes of Polish spaces under effective Borel isomorphism (Q5365177) (← links)
