Interpreting N in the computably enumerable weak truth table degrees

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a first-order coding without parameters of a copy of (N,+,×) in the computably enumerable weak truth table degrees. As a tool, we develop a theory of parameter definable subsets. © 2001 Elsevier Science B.V.

Cite

CITATION STYLE

APA

Nies, A. (2001). Interpreting N in the computably enumerable weak truth table degrees. Annals of Pure and Applied Logic, 107(1–3), 35–48. https://doi.org/10.1016/S0168-0072(00)00021-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free