Interpreting N in the computably enumerable weak truth table degrees

  • Nies A
  • 1

    Readers

    Mendeley users who have this article in their library.
  • 1

    Citations

    Citations of this article.

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.

Author-supplied keywords

  • Primary: 03D25
  • True arithmetic
  • Uniform definability
  • Weak truth table degrees

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • André Nies

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free