Density of a final segment of the truth-table degrees

DOI10.2140/PJM.1984.115.409zbMATH Open0534.03018OpenAlexW2091909693MaRDI QIDQ790105FDOQ790105

Authors: Jeanleah Mohrherr 

Publication date: 1984

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1984.115.409

Recommendations

• On the structures inside truth-table degrees
• Every incomplete computably enumerable truth-table degree is branching
• Intervals and sublattices of the r.e. weak truth table degrees. I: Density
• Two Theorems on Truth Table Degrees
• Semilattices of disjunctive and linear degrees

zbMATH Keywords

minimal coverhalting problemjump theoremtruth table degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (11)

• Bounded low and high sets
• Reals n-generic relative to some perfect tree
• Limits on jump inversion for strong reducibilities
• On the structures inside truth-table degrees
• The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
• A bounded jump for the bounded Turing degrees
• A Rigid Cone in the Truth-Table Degrees with Jump
• Two Theorems on Truth Table Degrees
• The d.r.e \(wtt\)-degrees are dense
• Automorphisms of the truth-table degrees are fixed on a cone
• An incomplete set of shortest descriptions

This page was built for publication: Density of a final segment of the truth-table degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790105)