scientific article; zbMATH DE number 1396732

MaRDI QIDQ4936684zbMATH OpenFDO

Authors V. N. Vlasov

Publication date 31 January 2000

zbMATH Keywords

constructive Boolean algebraconstructive modelrecursive model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Structure theory of Boolean algebras (06E05)

Recommendations

• Decidable Boolean algebras of characteristic \((1,0,1)\)
• Strong constructibility of Boolean algebras of elementary characteristic (1,1,0)
• scientific article; zbMATH DE number 934728
• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements

Cited in

(10)

• Strong constructibility of Boolean algebras of elementary characteristic (1,1,0)
• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• Decidable Boolean algebras of characteristic \((1,0,1)\)
• Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements
• scientific article; zbMATH DE number 4055586 (Why is no real title available?)
• scientific article; zbMATH DE number 1303207 (Why is no real title available?)
• Undecidability of the elementary theory of the semilattice of GLP-words
• scientific article; zbMATH DE number 1873428 (Why is no real title available?)
• A first-order completeness result about characteristic Boolean algebras in classical realizability
• Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable

This page was built for publication:

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