Σn sets which are δn-incomparable (uniformly)
Journal of Symbolic Logic 39 (2):295 - 304 (1974)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
|
| Through your library | Configure |
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.
Richard A. Shore (1978). Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets. Journal of Symbolic Logic 43 (2):322-330.
Theodore A. Slaman (1986). On the Kleene Degrees of Π11 Sets. Journal of Symbolic Logic 51 (2):352 - 359.
John P. Burgess (1988). Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
Saharon Shelah (1981). On Uncountable Boolean Algebras with No Uncountable Pairwise Comparable or Incomparable Sets of Elements. Notre Dame Journal of Formal Logic 22 (4):301-308.
Carl G. Jockusch Jr (1968). Uniformly Introreducible Sets. Journal of Symbolic Logic 33 (4):521-536.
H. R. Strong (1970). Construction of Models for Algebraically Generalized Recursive Function Theory. Journal of Symbolic Logic 35 (3):401-409.
Galen Weitkamp (1982). Analytic Sets Having Incomparable Kleene Degrees. Journal of Symbolic Logic 47 (4):860-868.
Sebastiaan A. Terwijn & Domenico Zambella (2001). Computational Randomness and Lowness. Journal of Symbolic Logic 66 (3):1199-1205.
T. A. Slaman (1986). ∑1 Definitions with Parameters. Journal of Symbolic Logic 51 (2):453 - 461.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |

