Analytic sets having incomparable Kleene degrees

Journal of Symbolic Logic 47 (4):860-868 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273105

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Comparing incomparable Kleene degrees.Philip Welch - 1985 - Journal of Symbolic Logic 50 (1):55-58.
High and low Kleene degrees of coanalytic sets.Stephen G. Simpson & Galen Weitkamp - 1983 - Journal of Symbolic Logic 48 (2):356-368.
Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability.R. M. Friedberg - 1958 - Journal of Symbolic Logic 23 (2):225-226.
On the Kleene degrees of Π 1 1 sets.Theodore A. Slaman - 1986 - Journal of Symbolic Logic 51 (2):352-359.
Local Density of Kleene Degrees.Hisato Muraki - 1995 - Mathematical Logic Quarterly 41 (2):183-189.
Friedberg R. M.. Two recursively enumerable sets of incomparable degrees of unsolvability . Proceedings of the National Academy of Sciences of the United States of America, vol. 43 , pp. 236–238. [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):225-226.
Maitra A. and Ryll-Nardzewski C.. On the existence of two analytic non-Borel sets which are not isomorphic. Bulletin de L'Académie Polonaise des Sciences, Série des sciences mathematiques, astronomiques et physiques, vol. 18 , pp. 177–178.Mauldin R. Daniel. On nonisomorphic analytic sets. Proceedings of the American Mathematical Society, vol. 58 , pp. 241–244.Hrbacek Karel. On the complexity of analytic sets. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 24 , pp. 419–425.Hrbacek Karel and Simpson Stephen G.. On Kleene degrees of analytic sets. The Kleene Symposium, Proceedings of the symposium held June 18–24, 1978 at Madison, Wisconsin, U.S.A., edited by Barwise Jon, Keisler H. Jerome, and Kunen Kenneth, Studies in logic and the foundations of mathematics, vol. 101, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1980, pp. 347–352.Harrington Leo. Analytic determinacy and 0#. [REVIEW]Jacques Stern - 1984 - Journal of Symbolic Logic 49 (2):665-668.
Σn sets which are Δn-incomparable.Richard A. Shore - 1974 - Journal of Symbolic Logic 39 (2):295 - 304.
$Sigman$ Sets which are $Deltan$-Incomparable (Uniformly).Richard A. Shore - 1974 - Journal of Symbolic Logic 39 (2):295-304.

Analytics

Added to PP
2009-01-28

Downloads
37 (#616,168)

6 months
16 (#194,625)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effective topological spaces I: A definability theory.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (1):1-27.
Effective topological spaces II: A hierarchy.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (2):207-224.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
On the Complexity of Analytic Sets.Karel Hrbacek - 1978 - Mathematical Logic Quarterly 24 (25‐30):419-425.
On the Complexity of Analytic Sets.Karel Hrbacek - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):419-425.

Add more references