Recursive prime models for Boolean algebras

DOI10.4064/CM-41-1-25-33zbMath0445.03016OpenAlexW275758669MaRDI QIDQ3889033

Jerud J. Mead

Publication date: 1979

Published in: Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/cm-41-1-25-33

zbMATH Keywords

finite axiomatizabilityprime modelLindenbaum algebrarecursive model theorystrong computabilitycomplete extension of the theory of Boolean algebras

Mathematics Subject Classification ID

Boolean algebras (Boolean rings) (06E99) Models of other mathematical theories (03C65)

Related Items (6)

Degrees of autostability for prime Boolean algebras ⋮ Strong constructivizability of countable saturated Boolean algebras ⋮ Boolean algebras autostable relative to \(n\)-decidable presentations ⋮ The index set of Boolean algebras autostable relative to strong constructivizations ⋮ Theory of Abelian groups with constructive models ⋮ Model theoretic properties in the variety generated by a primal algebra

This page was built for publication: Recursive prime models for Boolean algebras