On elementary theories of some lattices or α-recursively enumerable sets

DOI10.1016/0003-4843(78)90020-7zbMATH Open0391.03022OpenAlexW2030826771MaRDI QIDQ4172045FDOQ4172045

Authors: Manuel Lerman 

Publication date: 1978

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(78)90020-7

zbMATH Keywords

Decision ProblemAdmissible OrdinalsConstructible Successor CardinalsLattice of Alpha- Recursively Enumerable Sets

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Quantifier elimination, model completeness, and related topics (03C10)

Cited In (3)

• The \(\forall \exists \) theory of Peano \(\Sigma_1\) sentences
• Recursively enumerable sets and degrees
• A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets

This page was built for publication: On elementary theories of some lattices or α-recursively enumerable sets

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