Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees

DOI10.1090/MEMO/1284zbMATH Open1460.03002OpenAlexW3015717446MaRDI QIDQ5113922FDOQ5113922

Keng Meng Ng, Rodney G. Downey, Reed Solomon

Publication date: 19 June 2020

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/memo/1284

zbMATH Keywords

minimal degreeTuring degreecomputably enumerable setpromptly simple setfull approximation methodweak truth-table degree

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The recursively enumerable degrees are dense
• Computability and Randomness
• Effective procedures in field theory
• Classical recursion theory. The theory of functions and sets of natural numbers
• Minimal degrees and the jump operator
• Simple Proofs of Some Theorems on High Degrees of Unsolvability
• Recursively enumerable sets of positive integers and their decision problems
• Is it harder to factor a polynomial or to find a root?
• Computable fields and the bounded Turing reduction
• On degrees of recursive unsolvability
• Title not available (Why is that?)
• Distributive Initial Segments of the Degrees of Unsolvability
• Measures and their random reals
• Degrees bounding minimal degrees
• The weak truth table degrees of recursively enumerable sets
• Computability Theory and Differential Geometry
• A minimal degree less than 0’
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Title not available (Why is that?)
• Initial segments of the degrees of unsolvability Part II: minimal degrees
• Title not available (Why is that?)
• A Hierarchy of Turing Degrees
• Recursively enumerable many-one degrees
• Strong reducibilities
• Classification of degree classes associated with r.e. subspaces
• The existence of recursively enumerable minimal truth-tabular degrees
• The fractal nature of Riem/Diff. I.
• Presentations of computably enumerable reals.
• Computably Enumerable Reals and Uniformly Presentable Ideals
• Title not available (Why is that?)
• Undecidability and initial segments of the (r.e.) tt-degrees
• Initial segments of one-one degrees
• Maximal contiguous degrees
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Infimum properties differ in the weak truth-table degrees and the Turing degrees
• Weak truth table degrees of structures
• Hypersimplicity and semicomputability in the weak truth table degrees
• Every incomplete computably enumerable truth-table degree is branching
• Cupping and noncapping in the r.e. weak truth table and turing degrees
• Title not available (Why is that?)

This page was built for publication: Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees

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