PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES

DOI10.1142/S0219061303000236zbMath1025.03031OpenAlexW2067250586MaRDI QIDQ4408481

André Nies

Publication date: 27 November 2003

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219061303000236

zbMATH Keywords

idealstrue arithmeticrecursively enumerable degreesparameter definability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (7)

On definable filters in computably enumerable degrees ⋮ The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ On the definable ideal generated by the plus cupping c.e. degrees ⋮ Upper bounds on ideals in the computably enumerable Turing degrees ⋮ On the definable ideal generated by nonbounding c.e. degrees ⋮ Degree Structures: Local and Global Investigations ⋮ Lowness properties and randomness

Cites Work

• Coding in the partial order of enumerable sets
• Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
• The undecidability of the recursively enumerable degrees

This page was built for publication: PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES