Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees

DOI10.1016/S0168-0072(00)00021-XzbMath0970.03036OpenAlexW2074378085MaRDI QIDQ1840456

André Nies

Publication date: 11 February 2001

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(00)00021-x

zbMATH Keywords

true arithmeticweak truth table degreesuniform definability

Mathematics Subject Classification ID

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

Related Items (2)

Interpreting true arithmetic in the -enumeration degrees ⋮ PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES

Cites Work

• Computably enumerable sets and quasi-reducibility
• Coding in the partial order of enumerable sets
• Definability in the enumeration degrees
• The recursively enumerable degrees have infinitely many one-types
• Interpreting true arithmetic in the theory of the r.e. truth table degrees
• An extension of the nondiamond theorem in classical and α-recursion theory
• Interpretability and Definability in the Recursively Enumerable Degrees
• The Theory of the Degrees below 0 ′
• The theory of the recursively enumerable weak truth-table degrees is undecidable
• Model theory of the computably enumerable many-one degrees
• The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees
• Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees