Correction to “Simple r. e. degree structures”

DOI10.2307/2274430MaRDI QIDQ3789549zbMATH OpenOpenAlexFDO

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

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)

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

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)