Infima in the Recursively Enumerable Weak Truth Table Degrees
Notre Dame Journal of Formal Logic 38 (3):406-418 (1997)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesKlaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman (1996). Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. Journal of Symbolic Logic 61 (3):880-905.
Peter A. Fejer & Richard A. Shore (1988). Infima of Recursively Enumerable Truth Table Degrees. Notre Dame Journal of Formal Logic 29 (3):420-437.
Paul Fischer (1986). Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees. Journal of Symbolic Logic 51 (1):117-129.
Frank Stephan (2001). On the Structures Inside Truth-Table Degrees. Journal of Symbolic Logic 66 (2):731-770.
Rodney G. Downey & Steffen Lempp (1997). Contiguity and Distributivity in the Enumerable Turing Degrees. Journal of Symbolic Logic 62 (4):1215-1240.
Klaus Ambos-Spies, André Nies & Richard A. Shore (1992). The Theory of the Recursively Enumerable Weak Truth-Table Degrees is Undecidable. Journal of Symbolic Logic 57 (3):864-874.
Theodore A. Slaman & John R. Steel (1989). Complementation in the Turing Degrees. Journal of Symbolic Logic 54 (1):160-176.
Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore (2003). Decomposition and Infima in the Computably Enumerable Degrees. Journal of Symbolic Logic 68 (2):551-579.
Noam Greenberg (2005). The Role of True Finiteness in the Admissible Recursively Enumerable Degrees. Bulletin of Symbolic Logic 11 (3):398-410.
Stephan Wehner (1999). On Recursive Enumerability with Finite Repetitions. Journal of Symbolic Logic 64 (3):927-945.
R. G. Downey (1989). Recursively Enumerable M- and Tt-Degrees. I: The Quantity of M- Degrees. Journal of Symbolic Logic 54 (2):553-567.
Steffen Lempp & Theodore A. Slaman (1989). A Limit on Relative Genericity in the Recursively Enumerable Sets. Journal of Symbolic Logic 54 (2):376-395.
Michael E. Mytilinaios & Theodore A. Slaman (1988). Σ2-Collection and the Infinite Injury Priority Method. Journal of Symbolic Logic 53 (1):212 - 221.
Wolfgang Maass (1984). On the Orbits of Hyperhypersimple Sets. Journal of Symbolic Logic 49 (1):51-62.
Steffen Lempp & Manuel Lerman (1992). The Existential Theory of the Poset of R.E. Degrees with a Predicate for Single Jump Reducibility. Journal of Symbolic Logic 57 (3):1120-1130.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
