Decidability of the "almost all" theory of degrees

Journal of Symbolic Logic 37 (3):501-506 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272735

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,203

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

Prime models and almost decidability.Terrence Millar - 1986 - Journal of Symbolic Logic 51 (2):412-420.
The existential theory of the poset of R.e. Degrees with a predicate for single jump reducibility.Steffen Lempp & Manuel Lerman - 1992 - Journal of Symbolic Logic 57 (3):1120-1130.
On Cupping and Ahmad Pairs.Iskander Sh Kalimullin, Steffen Lempp, N. G. Keng & Mars M. Yamaleev - 2024 - Journal of Symbolic Logic 89 (3):1358-1369.
Almost everywhere domination.Natasha L. Dobrinen & Stephen G. Simpson - 2004 - Journal of Symbolic Logic 69 (3):914-922.
Questions of decidability and undecidability in number theory.B. Mazur - 1994 - Journal of Symbolic Logic 59 (2):353-371.
On the decidability of the theories of the arithmetic and hyperarithmetic degrees as uppersemilattices.James S. Barnes - 2017 - Journal of Symbolic Logic 82 (4):1496-1518.
The Bernays—Schönfinkel—Ramsey class for set theory: decidability.Alberto Policriti & Eugenio Omodeo - 2012 - Journal of Symbolic Logic 77 (3):896-918.
J. Stillwell, Reverse Mathematics: Proofs from the Inside Out, Princeton University Press, Princeton, 2018, xiii + 182 pp. [REVIEW]Jeffry L. Hirst - 2018 - Bulletin of Symbolic Logic 24 (2):176-177.
Issues of decidability and tractability.Witold Marciszewski (ed.) - 2006 - Białystok: University of Białystok.

Analytics

Added to PP
2009-01-28

Downloads
31 (#763,697)

6 months
10 (#281,857)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Measure and minimal degrees.J. B. Paris - 1977 - Annals of Mathematical Logic 11 (2):203-216.
Masstheoretische Ergebnisse für WT‐Grade.Friedrich Hebeisen - 1979 - Mathematical Logic Quarterly 25 (3-6):33-36.

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.
Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (30):457-472.
Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Mathematical Logic Quarterly 14 (30):457-472.

Add more references