Title of article :
Interpreting N in the computably enumerable weak truth table degrees
Original Research Article
Author/Authors :
André Nies، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
We give a first-order coding without parameters of a copy of View the MathML source in the computably enumerable weak truth table degrees. As a tool, we develop a theory of parameter definable subsets.
Keywords :
Weak truth table degrees , True arithmetic , Uniform definability
Journal title :
Annals of Pure and Applied Logic
Journal title :
Annals of Pure and Applied Logic
