7 found
Sort by:
  1. Thomas F. Kent, Andrew Em Lewis & Andrea Sorbi (2012). Empty Intervals in the Enumeration Degrees. Annals of Pure and Applied Logic 163 (5):567-574.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Thomas F. Kent (2010). Interpreting True Arithmetic in the Δ 0 2 -Enumeration Degrees. Journal of Symbolic Logic 75 (2):522-550.
    We show that there is a first order sentence φ(x; a, b, l) such that for every computable partial order.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Thomas F. Kent (2009). The Structure of the s-Degrees Contained Within a Single E-Degree. Annals of Pure and Applied Logic 160 (1):13-21.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. Maria L. Affatato, Thomas F. Kent & Andrea Sorbi (2008). Branching in the {Sigma^0_2} -Enumeration Degrees: A New Perspective. [REVIEW] Archive for Mathematical Logic 47 (3):221-231.
    We give an alternative and more informative proof that every incomplete ${\Sigma^{0}_{2}}$ -enumeration degree is the meet of two incomparable ${\Sigma^{0}_{2}}$ -degrees, which allows us to show the stronger result that for every incomplete ${\Sigma^{0}_{2}}$ -enumeration degree a, there exist enumeration degrees x 1 and x 2 such that a, x 1, x 2 are incomparable, and for all b ≤ a, b = (b ∨ x 1 ) ∧ (b ∨ x 2 ).
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Maria L. Affatato, Thomas F. Kent & Andrea Sorbi (2008). Branching in the InlineEquation ID=" IEq1"> ImageObject FileRef=" 153200881ArticleIEq1. Gif" Format=" GIF" Color=" BlackWhit" Type=" Linedraw" Rendition=" HTML"/> EquationSource Format=" TEX">-Enumeration. [REVIEW] Archive for Mathematical Logic 47 (3):221-232.
    No categories
     
    My bibliography  
     
    Export citation  
  6. Thomas F. Kent & Andrea Sorbi (2007). Bounding Nonsplitting Enumeration Degrees. Journal of Symbolic Logic 72 (4):1405 - 1417.
    We show that every nonzero $\Sigma _{2}^{0}$ enumeration degree bounds a nonsplitting nonzero enumeration degree.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Thomas F. Kent (2006). The Π₃-Theory of the [Image] -Enumeration Degrees Is Undecidable. Journal of Symbolic Logic 71 (4):1284 - 1302.
    We show that in the language of {≤}, the Π₃-fragment of the first order theory of the $\Sigma _{2}^{0}$-enumeration degrees is undecidable. We then extend this result to show that the Π₃-theory of any substructure of the enumeration degrees which contains the $\Delta _{2}^{0}$-degrees is undecidable.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation