Correction to “Simple r. e. degree structures”

DOI10.2307/2274430zbMATH Open0646.03043OpenAlexW4242069917MaRDI QIDQ3789549FDOQ3789549

Authors: Robert S. Lubarsky 

Publication date: 1988

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274430

Recommendations

• Simple r. e. degree structures
• Enumerations, countable structures and Turing degrees
• Some New Lattice Constructions in High R. E. Degrees
• The recursively enumerable degrees have infinitely many one-types
• scientific article; zbMATH DE number 733391

zbMATH Keywords

nonstandard modelsrecursively enumerable degreesBarwise compactnesslocally countable admissible sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited In (1)

• Simple r. e. degree structures

This page was built for publication: Correction to “Simple r. e. degree structures”

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789549)