Strongly constructive Boolean algebras-Reference-Cited by-同舟云学术

Strongly constructive Boolean algebras

Published:2005-01 Issue:1 Volume:44 Page:1-12
ISSN:0002-5232
Container-title:Algebra and Logic
language:en
Short-container-title:Algebr Logic

Author:

Alaev P. E.

Publisher

Springer Science and Business Media LLC

Subject

Logic,Analysis

Link

http://link.springer.com/content/pdf/10.1007/s10469-005-0001-4.pdf

Reference13 articles.

1. S. S. Goncharov, ?Bounded theories of constructive Boolean algebras,? Sib. Mat. Zh., 17, No. 4, 797?812 (1976).

2. Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (eds.), Handbook of Recursive Mathematics, Vol. 2, Elsevier, Amsterdam (1998).

3. Y. L. Ershov and S. S. Goncharov (eds.), The Logical Notebook, Unsolved Problems in Mathematical Logic, Institute of Mathematics SO AN SSSR, Novosibirsk (1986).

4. S. S. Goncharov, Countable Boolean Algebras [in Russian], Nauka, Novosibirsk (1988).

5. S. S. Goncharov, Countable Boolean Algebras and Decidability, Siberian School of Algebra and Logic [in Russian], Nauch. Kniga, Novosibirsk (1996).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Strong Constructivizability of Boolean Algebras of Elementary Characteristic (∞, 0, 0);Algebra and Logic;2014-05

2. Sufficient Conditions for Decidability of Boolean Algebras;Journal of Mathematical Sciences;2013-11-16

3. Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements;Journal of Mathematical Sciences;2012-09-16

4. The minimality of certain decidability conditions for Boolean algebras;Siberian Mathematical Journal;2012-01