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)

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

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)