Simple r. e. degree structures

DOI10.2307/2273875MaRDI QIDQ3029000zbMATH OpenOpenAlexFDO

Authors Robert S. Lubarsky

Publication date 1987

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

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

zbMATH Keywords

Barwise compactnesslocally countable admissible setsnonstandard modelsr.e. degrees

Mathematics Subject Classification ID

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

Recommendations

• Correction to “Simple r. e. degree structures”
• Some New Lattice Constructions in High R. E. Degrees
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
• On Pairs of Recursively Enumerable Degrees
• scientific article; zbMATH DE number 4164825

Cites work

• Negative solutions to Post's problem. II
• Uncountable admissibles. II: Compactness

Cited in

(4)

• The structure of the s-degrees contained within a single e-degree
• On the r. e. predecessors of d. r. e. degrees
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
• Correction to “Simple r. e. degree structures”

This page was built for publication: Simple r. e. degree structures

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