Translator Disclaimer
December 2012 Interpreting true arithmetic in the local structure of the enumeration degrees
Hristo Ganchev, Mariya Soskova
J. Symbolic Logic 77(4): 1184-1194 (December 2012). DOI: 10.2178/jsl.7704070

Abstract

We show that the theory of the local structure of the enumeration degrees is computably isomorphic to the theory of first order arithmetic. We introduce a novel coding method, using the notion of a $\mathcal{K}$-pair, to code a large class of countable relations.

Citation

Download Citation

Hristo Ganchev. Mariya Soskova. "Interpreting true arithmetic in the local structure of the enumeration degrees." J. Symbolic Logic 77 (4) 1184 - 1194, December 2012. https://doi.org/10.2178/jsl.7704070

Information

Published: December 2012
First available in Project Euclid: 15 October 2012

zbMATH: 1257.03066
MathSciNet: MR3051620
Digital Object Identifier: 10.2178/jsl.7704070

Rights: Copyright © 2012 Association for Symbolic Logic

JOURNAL ARTICLE
11 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.77 • No. 4 • December 2012
Back to Top