Recursion theory on orderings. I. A model theoretic setting

DOI10.2307/2273131zbMath0471.03035OpenAlexW2030011401MaRDI QIDQ3924184

G. Metakides, Jeffery B. Remmel

Publication date: 1979

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

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

zbMATH Keywords

creative setsmaximal setscomplete decidable theoryhypersimple setscreative presentationdecidable atomsdegree of maximal setsdense creative suborderingmaximal substructuren-dimensional partial orderingsnatural numbers under equalityrational numbers under the usual orderingrecursively presented atomic models

Mathematics Subject Classification ID

Model theory (03C99) Theory of numerations, effectively presented structures (03D45)

Related Items

Recursion theory on orderings. II, The given

Cites Work

• Unnamed Item
• Three theorems on the degrees of recursively enumerable sets
• Recursively enumerable vector spaces
• Recursively enumerable Boolean algebras
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Creative sets