Enumerations, countable structures and Turing degrees-Reference-Cited by-同舟云学术

Enumerations, countable structures and Turing degrees

Published:1998 Issue:7 Volume:126 Page:2131-2139
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Wehner Stephan

Abstract

It is proven that there is a family of sets of natural numbers which has enumerations in every Turing degree except for the recursive degree. This implies that there is a countable structure which has representations in all but the recursive degree. Moreover, it is shown that there is such a structure which has a recursively represented elementary extension.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1998-126-07/S0002-9939-98-04314-7/S0002-9939-98-04314-7.pdf

Reference7 articles.

1. Jumps of orderings;Ash, C. J.;Trans. Amer. Math. Soc.,1990

2. Degrees coded in jumps of orderings;Knight, Julia F.;J. Symbolic Logic,1986

3. Degrees of structures;Richter, Linda Jean;J. Symbolic Logic,1981

4. Theodore A. Slaman; Relative to any Nonrecursive Set, Proc. Amer. Math. Soc., vol. 126 (1998), 2117–2122.

5. Perspectives in Mathematical Logic;Soare, Robert I.,1987

Cited by 80 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enumerations of families closed under finite differences;Computability;2023-10-25

2. A Local Version of the Slaman–Wehner Theorem and Families Closed Under Finite Differences;Notre Dame Journal of Formal Logic;2023-05-01

3. Punctual Structures and Primitive Recursive Reducibility;Lobachevskii Journal of Mathematics;2022-03

4. New Degree Spectra of Polish Spaces;Siberian Mathematical Journal;2021-09

5. Computable Categoricity;Computable Structure Theory;2021-07-31