A completely mitotic nonrecursive r.e. degree-Reference-Cited by-同舟云学术

A completely mitotic nonrecursive r.e. degree

Published:1973 Issue:0 Volume:184 Page:479-507
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Ladner Richard E.

Abstract

A nonrecursive r.e. degree d is constructed that has the property that every r.e. set of degree d is mitotic. The degree d has several other interesting properties including the property that any two r.e. sets of degree d are weak truth table equivalent.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1973-184-00/S0002-9947-1973-0398805-7/S0002-9947-1973-0398805-7.pdf

Reference6 articles.

1. Degrees in which the recursive sets are uniformly recursive;Jockusch, Carl G., Jr.;Canadian J. Math.,1972

2. Mitotic recursively enumerable sets;Ladner, Richard E.;J. Symbolic Logic,1973

3. Deficiency sets and bounded information reducibilities;Sasso, Leonard P., Jr.;Trans. Amer. Math. Soc.,1974

4. Three theorems on the degrees of recursively enumerable sets;Yates, C. E. M.;Duke Math. J.,1965

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

1. On initial segments of the class of turing degrees containing hypersimple T-mitotic but not wtt-mitotic sets;PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON FRONTIER OF DIGITAL TECHNOLOGY TOWARDS A SUSTAINABLE SOCIETY;2023

2. Some Observations on Mitotic Sets;Logic, Computation and Rigorous Methods;2021

3. On Initial Segments of Turing Degrees Containing Simple T-Mitotic but not wtt-Mitotic Sets;Mathematical Problems of Computer Science;2019-12-25

4. Splitting theorems and low degrees;Computability;2019-09-20

5. Irreducible, Singular, and Contiguous Degrees;Algebra and Logic;2017-07