Intervals and sublattices of the r.e. weak truth table degrees. I: Density

DOI10.1016/0168-0072(89)90005-5zbMath0628.03031OpenAlexW2048767471MaRDI QIDQ1092896

Rodney G. Downey

Publication date: 1989

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(89)90005-5

zbMATH Keywords

countable atomless boolean algebrar.e. wtt-degreesweak truth table

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding ⋮ Lattice nonembeddings and initial segments of the recursively enumerable degrees ⋮ Splitting theorems in recursion theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural interactions of the recursively enumerable T- and W-degrees
• Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding
• Classification of degree classes associated with r.e. subspaces
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• Classical recursion theory. Vol. II
• The recursively enumerable degrees have infinitely many one-types
• The recursively enumerable degrees are dense
• On the degrees less than 0'
• On Pairs of Recursively Enumerable Degrees
• The undecidability of the recursively enumerable degrees
• Wtt-degrees and T-degrees of r.e. sets
• The Degrees of R.E. Sets Without the Universal Splitting Property
• Anti‐Mitotic Recursively Enumerable Sets
• Pairs without infimum in the recursively enumerable weak truth table degrees
• Splitting properties of r.e. sets and degrees
• Lattice embeddings into the recursively enumerable degrees
• Localization of a theorem of Ambos-Spies and the strong anti-splitting property
• T-Degrees, Jump Classes, and Strong Reducibilities
• Reducibility and Completeness for Sets of Integers
• Bounding minimal pairs
• Decomposition of Recursively Enumerable Degrees
• Strong reducibilities
• Minimal pairs and high recursively enumerable degrees
• The weak truth table degrees of recursively enumerable sets
• The infinite injury priority method
• A recursively enumerable degree which will not split over all lesser ones
• Recursively enumerable sets and degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees