Title of article
Interpreting N in the computably enumerable weak truth table degrees Original Research Article
Author/Authors
André Nies، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
14
From page
35
To page
48
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
Serial Year
2001
Journal title
Annals of Pure and Applied Logic
Record number
889751
Link To Document