Interpreting true arithmetic in the local structure of the enumeration degrees

DOI10.2178/JSL.7704070zbMath1257.03066OpenAlexW2154697548MaRDI QIDQ4899167

Hristo Ganchev, Mariya Ivanova Soskova

Publication date: 7 January 2013

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1350315582

zbMATH Keywords

first-order arithmeticenumeration degreesenumeration reducibility

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (7)

The automorphism group of the enumeration degrees ⋮ Extensions of two constructions of Ahmad ⋮ The theory of ceers computes true arithmetic ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Cupping and definability in the local structure of the enumeration degrees ⋮ On Kalimullin pairs ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees

Cites Work

• Definability in the enumeration degrees
• The last question on recursively enumerable \(m\)-degrees
• Embedding distributive lattices in the  Formula enumeration degrees
• Interpretability and Definability in the Recursively Enumerable Degrees
• Reducibility and Completeness for Sets of Integers
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES

This page was built for publication: Interpreting true arithmetic in the local structure of the enumeration degrees