On the lattice of recursively enumerable sets-Reference-Cited by-同舟云学术

On the lattice of recursively enumerable sets

Published:1968 Issue:1 Volume:130 Page:1-37
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Lachlan A. H.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1968-130-01/S0002-9947-1968-0227009-1/S0002-9947-1968-0227009-1.pdf

Reference11 articles.

1. McGraw-Hill Series in Information Processing and Computers;Davis, Martin,1958

2. Decidability of the elementary theory of relatively complemented lattices and of the theory of filters;Eršov, Ju. L.;Algebra i Logika Sem.,1964

3. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication;Friedberg, Richard M.;J. Symbolic Logic,1958

4. 4-quantifier completeness: A Banach-Mazur functional not uniformly partial recursive;Friedberg, Richard M.;Bull. Acad. Polon. Sci. S\'{e}r. Sci. Math. Astr. Phys.,1958

5. A theorem on hyperhypersimple sets;Martin, Donald A.;J. Symbolic Logic,1963

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

1. Turing Computability: Structural Theory;Journal of Mathematical Sciences;2021-05-28

2. r ‐Maximal sets and Q1,N‐reducibility;Mathematical Logic Quarterly;2021-05

3. Closed left-r.e. sets;Computability;2016-12-22

4. Duality, non-standard elements, and dynamic properties of r.e. sets;Annals of Pure and Applied Logic;2016-10

5. Peano Arithmetic Models and Computability;Algebraic Computability and Enumeration Models;2016-02-25