Interpreting N in the computably enumerable weak truth table degrees

https://doi.org/10.1016/S0168-0072(00)00021-XGet rights and content
Under an Elsevier user license
open archive

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.

MSC

primary: 03D25

Keywords

Weak truth table degrees
True arithmetic
Uniform definability

Cited by (0)

1

Partially supported by NSF grant DMS-9803482.