Coding in the Partial Order of Enumerabl
β
Leo Harrington; AndrΓ© Nies
π
Article
π
1998
π
Elsevier Science
π
English
β 489 KB
We develop methods for coding with first-order formulas into the partial order E of enumerable sets under inclusion. First we use them to reprove and generalize the (unpublished) result of the first author that the elementary theory of E has the same computational complexity as the theory of the nat