Coding in the partial order of enumerable sets

DOI10.1006/aima.1997.1687zbMath0890.03016OpenAlexW1991182213MaRDI QIDQ1380333

André Nies, Leo Harrington

Publication date: 31 March 1998

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aima.1997.1687

zbMATH Keywords

definabilitycodingtrue arithmeticenumerable setsquasimaximal sets

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25)

Related Items

ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS, On the Lattices of Effectively Open Sets, Boolean pairs formed by the \(\Delta_ n^ 0\)-sets, Effectively inseparable Boolean algebras in lattices of sentences, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, Atomless \(r\)-maximal sets, Isomorphisms of splits of computably enumerable sets, Interpreting true arithmetic in the -enumeration degrees, Computably enumerable sets and related issues, PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES, Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees, Effectively dense Boolean algebras and their applications, Definable Encodings in the Computably Enumerable Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability in the Turing degrees
• The elementary theory of recursively enumerable sets
• The last question on recursively enumerable \(m\)-degrees
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• The first order properties of products of algebraic systems
• Hyperarithmetical Index Sets in Recursion Theory
• Interpretability and Definability in the Recursively Enumerable Degrees
• The Theory of the Degrees below 0 ′
• Post's program and incomplete recursively enumerable sets.
• Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
• Effectively dense Boolean algebras and their applications
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability