|
Relative to any nonrecursive set
Author(s):
Theodore
A.
Slaman
Journal:
Proc. Amer. Math. Soc.
126
(1998),
2117-2122.
MSC (1991):
Primary 03C57, 04D45
MathSciNet review:
1443408
Retrieve article in:
PDF
This article is available free of charge
Abstract |
References |
Similar articles |
Additional information
Abstract:
There is a countable first order structure  such that for any set of integers  ,  is not recursive if and only if there is a presentation of  which is recursive in  .
References:
- [Kleene and Post]
- Kleene, S. C. and Post, E. L. [1954]. The upper semi-lattice of degrees of recursive unsolvability, Anal. Math. 59: 379-407. MR 15:772a
- [Wehner]
- Wehner, S. [1996]. Enumerations, countable structures and Turing degrees, Proc. Amer. Math. Soc. 126 (1998), 2131-2139. CMP 97:11
Similar Articles:
Retrieve articles in Proceedings of the American Mathematical
Society
with
MSC (1991):
03C57, 04D45
Retrieve articles in all Journals with
MSC (1991):
03C57, 04D45
Additional Information:
Theodore
A.
Slaman
Affiliation:
Department of Mathematics, The University of Chicago, Chicago, Illinois 60637
Address at time of publication:
Department of Mathematics, University of California, Berkeley, California 94720-3840
Email:
ted@math.uchicago.edu
DOI:
10.1090/S0002-9939-98-04307-X
PII:
S 0002-9939(98)04307-X
Keywords:
Recursive model theory
Received by editor(s):
May 10, 1996
Received by editor(s) in revised form:
December 17, 1996
Additional Notes:
During the preparation of this paper, Slaman was partially supported by National Science Foundation Grant DMS-9500878.
Communicated by:
Andreas R. Blass
Copyright of article:
Copyright
1998,
American Mathematical Society
|
