On the structures inside truth-table degrees
From MaRDI portal
Publication:2747717
DOI10.2307/2695042zbMath1004.03035OpenAlexW2106434096MaRDI QIDQ2747717
Publication date: 6 February 2003
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2695042
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On degrees of recursive unsolvability
- Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets
- Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
- Nondeterministic bounded query reducibilities
- Nilpotency of ideals in (-1,1) rings with minimum condition
- A comparison of polynomial time reducibilities
- Terse, superterse, and verbose sets
- Quantifying the amount of verboseness
- Recursion theoretic properties of frequency computation and bounded queries
- Interpolation and embedding in the recursively enumerable degrees
- Jump restricted interpolation in the recursively enumerable degrees
- Sublattices of the polynomial time degrees
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- Retraceable Sets
- Reducibility and Completeness for Sets of Integers
- Post's program and incomplete recursively enumerable sets.
- Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices
- A theorem on minimal degrees
- On a Class of Complete Simple Sets
- The Degrees of Hyperimmune Sets
- Recursively enumerable sets of positive integers and their decision problems
