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 A-pair, to code a large class of countable relations. |
Year | DOI | Venue |
---|---|---|
2012 | 10.2178/jsl.7704070 | JOURNAL OF SYMBOLIC LOGIC |
DocType | Volume | Issue |
Journal | 77 | 4 |
ISSN | Citations | PageRank |
0022-4812 | 1 | 0.39 |
References | Authors | |
3 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hristo Ganchev | 1 | 5 | 4.04 |
Mariya Ivanova Soskova | 2 | 21 | 10.54 |