The minimality of certain decidability conditions for Boolean algebras

DOI10.1134/S0037446612010090MaRDI QIDQ416985zbMATH OpenFDO

Authors M. N. Leont'eva

Publication date 10 May 2012

Published in Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

Boolean algebracomputable model\(n\)-computabilitycomputable setdecidable modelelementary characteristic of a Boolean algebraErshov-Tarski idealstrongly computable model

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57) Structure theory of Boolean algebras (06E05)

Recommendations

• Sufficient solvability conditions for Boolean algebras
• Decidable Boolean algebras of low level
• Decidable Boolean algebras of characteristic \((1,0,1)\)
• scientific article; zbMATH DE number 934728
• scientific article; zbMATH DE number 1002913

Cites work

• scientific article; zbMATH DE number 2154083 (Why is no real title available?)
• scientific article; zbMATH DE number 2154086 (Why is no real title available?)
• scientific article; zbMATH DE number 2154090 (Why is no real title available?)
• scientific article; zbMATH DE number 934728 (Why is no real title available?)
• scientific article; zbMATH DE number 3316934 (Why is no real title available?)
• Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable
• Computable structures and the hyperarithmetical hierarchy
• Restricted theories of constructive Boolean algebras
• Some properties of the constructivization of Boolean algebras
• Strongly constructive Boolean algebras
• The existence of strongly computable representations in the class of Boolean algebras

Cited in

(12)

• Primitivity, uniform minimality, and state complexity of Boolean operations
• New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial
• scientific article; zbMATH DE number 4055586 (Why is no real title available?)
• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• Sufficient solvability conditions for Boolean algebras
• Minimally generated Boolean algebras
• scientific article; zbMATH DE number 4037810 (Why is no real title available?)
• Minimally generated Boolean algebras and the Nikodym property
• On the 1-decidability of Boolean algebras with one distinguished ideal
• On the boolean minimal realization problem in the max-plus algebra
• Deciding the word problem in pure double Boolean algebras
• scientific article; zbMATH DE number 2203952 (Why is no real title available?)

This page was built for publication: The minimality of certain decidability conditions for Boolean algebras

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