Index sets related to prompt simplicity

Annals of Pure and Applied Logic 42 (3):243-254 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90018-3

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,031

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

Simplicity of the automorphism groups of some Hrushovski constructions.David M. Evans, Zaniar Ghadernezhad & Katrin Tent - 2016 - Annals of Pure and Applied Logic 167 (1):22-48.
Author index.[author unknown] - 1986 - Annals of Pure and Applied Logic 32 (3):299.
Author index.[author unknown] - 1989 - Annals of Pure and Applied Logic 42:299.
Author Index.[author unknown] - 2006 - Annals of Pure and Applied Logic 139 (1):400.
Author Index.[author unknown] - 2004 - Annals of Pure and Applied Logic 130 (1):339.
Author Index.[author unknown] - 2005 - Annals of Pure and Applied Logic 133 (1):339-340.
Σ5-completeness of index sets arising from the recursively enumerable Turing degrees.Michael A. Jahn - 1996 - Annals of Pure and Applied Logic 79 (2):109-137.
Guessing more sets.Pierre Matet - 2015 - Annals of Pure and Applied Logic 166 (10):953-990.
On n -tardy sets.Peter A. Cholak, Peter M. Gerdes & Karen Lange - 2012 - Annals of Pure and Applied Logic 163 (9):1252-1270.

Analytics

Added to PP
2014-01-16

Downloads
19 (#1,117,267)

6 months
5 (#702,938)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Incomparable prime ideals of recursively enumerable degrees.William C. Calhoun - 1993 - Annals of Pure and Applied Logic 63 (1):39-56.

Add more citations

References found in this work

Recursive predicates and quantifiers.S. C. Kleene - 1943 - Transactions of the American Mathematical Society 53:41-73.
On Definable Sets of Positive Integers.Andrzej Mostowski - 1948 - Journal of Symbolic Logic 13 (2):112-113.
Computing Degrees of Unsolvability.Hartley Rogers - 1960 - Journal of Symbolic Logic 25 (4):363-364.

Add more references