PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES

DOI10.1142/S0219061303000236zbMATH Open1025.03031OpenAlexW2067250586MaRDI QIDQ4408481FDOQ4408481

Authors: 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

Recommendations

• Interpretability and Definability in the Recursively Enumerable Degrees
• Definability in the Turing degrees
• scientific article; zbMATH DE number 1531930
• Definability in the Recursively Enumerable Degrees
• Low level nondefinability results: domination and recursive enumeration

zbMATH Keywords

idealstrue arithmeticrecursively enumerable degreesparameter definability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• Minimal predicates for \(\Delta \)-definability
• On the definable ideal generated by nonbounding c.e. degrees
• Definability in the Turing degrees
• On the definable ideal generated by the plus cupping c.e. degrees
• On definable filters in computably enumerable degrees
• Upper bounds on ideals in the computably enumerable Turing degrees
• Title not available (Why is that?)
• Lowness properties and randomness
• Degree Structures: Local and Global Investigations
• Interpretability and Definability in the Recursively Enumerable Degrees
• Extending properly n - REA sets1
• Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable

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

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