On the reducibility of \(\Pi_ 1^ 1\) sets
From MaRDI portal
Publication:2547889
DOI10.1016/0001-8708(71)90042-9zbMath0223.02045OpenAlexW1971900679MaRDI QIDQ2547889
Publication date: 1971
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(71)90042-9
Related Items (2)
Forcing and reductibilities. II. Forcing in fragments of analysis ⋮ Forcing and reducibilities. III. Forcing in fragments of set theory
Cites Work
- Surrealist landscape with figures (a survey of recent results in set theory)
- On the degrees less than 0'
- Recursive well-orderings
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- Some applications of the notions of forcing and generic sets
- Post's Problem, Admissible Ordinals, and Regularity
- Metarecursive sets
- Some applications of forcing to hierarchy problems in arithmetic
- Recursion, metarecursion, and inclusion
- A minimal hyperdegree
- Shorter Notes: A Note on the Failure of the Relativized Enumeration Theorem in Recursive Function Theory
- Metarecursively enumerable sets and their metadegrees
- Recursively enumerable sets of positive integers and their decision problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the reducibility of \(\Pi_ 1^ 1\) sets
