Definability in the Turing degrees

MaRDI QIDQ1075320zbMATH OpenFDO

Authors Theodore A. Slaman, W. Hugh Woodin

Publication date 1986

Published in Illinois Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

rigidityautomorphismforcingjumprecursively enumerable degrees

Mathematics Subject Classification ID

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

Recommendations

• PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
• Interpretability and Definability in the Recursively Enumerable Degrees
• Definability in the Recursively Enumerable Degrees
• scientific article; zbMATH DE number 66485
• scientific article; zbMATH DE number 1531930

Cited in

(34)

• Embedding and coding below a 1-generic degree
• The relationship between local and global structure in the enumeration degrees
• Definable relations in Turing degree structures
• The theory of ceers computes true arithmetic
• scientific article; zbMATH DE number 7360060 (Why is no real title available?)
• The Turing degrees below generics and randoms
• Definable Filters in the Structure of Bounded Turing Reductions
• scientific article; zbMATH DE number 2204762 (Why is no real title available?)
• The typical Turing degree
• Turing computability: structural theory
• An oracle builder's toolkit
• Computing sets from all infinite subsets
• Local Initial Segments of The Turing Degrees
• The Turing degrees: an introduction
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• Coding in the partial order of enumerable sets
• scientific article; zbMATH DE number 3861135 (Why is no real title available?)
• The First Order Theories of the Medvedev and Muchnik Lattices
• Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
• PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
• Definability by turing machines
• scientific article; zbMATH DE number 2226385 (Why is no real title available?)
• Generic degrees are complemented
• On the theory of the PTIME degrees of the recursive sets
• A non-splitting theorem for d.r.e. sets
• The theory of the \(\alpha \) degrees is undecidable
• scientific article; zbMATH DE number 1531930 (Why is no real title available?)
• Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms
• The enumeration degrees: local and global structural interactions
• The \(\Delta ^0_2\) Turing degrees: automorphisms and definability
• The jump is definable in the structure of the degrees of unsolvability
• The \(\omega\)-Turing degrees
• Some properties of an algebra of all sets of naturals e-reducible to a fixed set
• Defining totality in the enumeration degrees

This page was built for publication: Definability in the Turing degrees

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