Author:
Odintsov S. P.,Selivanov V. L.
Publisher
Springer Science and Business Media LLC
Reference5 articles.
1. L. Feiner, ?Hierarchies of Boolean algebras,? J. Symbol. Logic,35, No. 3, 365?373 (1970).
2. S. S. Goncharov, ?Certain properties of constructivization of Boolean algebras,? Sib. Mat. Zh.,16, No. 2, 264?278 (1975).
3. A. H. Lachlan, ?On the properties of recursively enumerable sets,? Trans. Am. Math. Soc.,130, No. 1, 1?37 (1968).
4. V. D. Dzgoev, ?On constructivizability of Boolean algebras,? All-Union Conference on Mathematical Logic, Kishinev, September 1976, Shtiintsa, 42 (1976).
5. V. L. Selivanov, ?On the algorithmic complexity of algabraic systems,? Mat. Zametki,42, No. 6, 823?832 (1988).
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Separating notions in effective topology;International Journal of Algebra and Computation;2023-10-31
2. Computable Stone spaces;Annals of Pure and Applied Logic;2023-10
3. COMPUTABLE TOPOLOGICAL GROUPS;The Journal of Symbolic Logic;2023-09-18
4. Definable Subsets of Polynomial-Time Algebraic Structures;Computer Science – Theory and Applications;2020
5. Positive Preorders;Algebra and Logic;2018-07