Relative to any nonrecursive set
Author: Theodore A. Slaman
Journal: Proc. Amer. Math. Soc. 126 (1998), 2117-2122
MSC (1991): Primary 03C57, 04D45
MathSciNet review: 1443408
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 .
- [Kleene and Post]
- Kleene, S. C. and Post, E. L. . The upper semi-lattice of degrees of recursive unsolvability, Anal. Math. 59: 379-407. MR 15:772a
- Wehner, S. . Enumerations, countable structures and Turing degrees, Proc. Amer. Math. Soc. 126 (1998), 2131-2139. CMP 97:11
Theodore A. Slaman
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
Article copyright: © Copyright 1998 American Mathematical Society