Switch to: References

Add citations

You must login to add citations.
  1. Infima in the Recursively Enumerable Weak Truth Table Degrees.Rich Blaylock, Rod Downey & Steffen Lempp - 1997 - Notre Dame Journal of Formal Logic 38 (3):406-418.
    We show that for every nontrivial r.e. wtt-degree a, there are r.e. wtt-degrees b and c incomparable to a such that the infimum of a and b exists but the infimum of a and c fails to exist. This shows in particular that there are no strongly noncappable r.e. wtt-degrees, in contrast to the situation in the r.e. Turing degrees.
    Download  
     
    Export citation  
     
    Bookmark  
  • Intervals and sublattices of the R.E. weak truth table degrees, part I: Density.R. G. Downey - 1989 - Annals of Pure and Applied Logic 41 (1):1-26.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Intervals and sublattices of the r.e. weak truth table degrees, part II: Nonbounding.R. G. Downey - 1989 - Annals of Pure and Applied Logic 44 (3):153-172.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Structural interactions of the recursively enumerable T- and W-degrees.R. G. Downey & M. Stob - 1986 - Annals of Pure and Applied Logic 31:205-236.
    Download  
     
    Export citation  
     
    Bookmark   12 citations