Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Statistics and Probability
Reference7 articles.
1. S. S. Goncharov, Countable Boolean Algebra and Decidability [in Russian], Nauchnaya Kniga (IDMI), Novosibirsk (1986); English tranls.: Plenum, New York (1997).
2. Yu. L. Ershov, “Decidability of elementary theories of relatively complemented distributive lattices and the theory of filters” [in Russian], Algebra Logika 3, No. 3, 17–38 (1964).
3. S. S. Goncharov, “Restricted theories of constructive Boolean algebra” [in Russian], Sib. Mat. Zh. 17, No. 4, 797–812 (1976); English transl.: Sib. Math. J. 17, No. 4, 601–611 (1976).
4. P. E. Alaev, “Strongly constructive Boolean algebras” [in Russian], Algebra Logika 7, No. 1, 3–23 (2005); English transl.: Algebra Logic 44, No. 1, 1–12 (2005).
5. V. N. Vlasov, “Constructivizability of Boolean algebras of elementary characteristic (1, 0, 1)” [in Russian], Algebra Logika 37, No. 5, 499–521 (1998); English transl.: Algebra Logic 37, No. 5, 279–293 (1998).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献