Relative to any nonrecursive set
HTML articles powered by AMS MathViewer
- by Theodore A. Slaman PDF
- Proc. Amer. Math. Soc. 126 (1998), 2117-2122 Request permission
Abstract:
There is a countable first order structure $\mathcal {M}$ such that for any set of integers $X$, $X$ is not recursive if and only if there is a presentation of $\mathcal {M}$ which is recursive in $X$.References
- Sam Perlis, Maximal orders in rational cyclic algebras of composite degree, Trans. Amer. Math. Soc. 46 (1939), 82–96. MR 15, DOI 10.1090/S0002-9947-1939-0000015-X
- Wehner, S. [1996]. Enumerations, countable structures and Turing degrees, Proc. Amer. Math. Soc. 126 (1998), 2131–2139.
Additional Information
- Theodore A. Slaman
- MR Author ID: 163530
- Email: ted@math.uchicago.edu
- 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 1998 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 126 (1998), 2117-2122
- MSC (1991): Primary 03C57, 04D45
- DOI: https://doi.org/10.1090/S0002-9939-98-04307-X
- MathSciNet review: 1443408