Siberian Mathematical Journal

, Volume 30, Issue 6, pp 952–960 | Cite as

Arithmetic Hierarchy and ideals of enumerated Boolean algebras

  • S. P. Odintsov
  • V. L. Selivanov


Boolean Algebra Arithmetic Hierarchy 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    L. Feiner, “Hierarchies of Boolean algebras,” J. Symbol. Logic,35, No. 3, 365–373 (1970).Google Scholar
  2. 2.
    S. S. Goncharov, “Certain properties of constructivization of Boolean algebras,” Sib. Mat. Zh.,16, No. 2, 264–278 (1975).Google Scholar
  3. 3.
    A. H. Lachlan, “On the properties of recursively enumerable sets,” Trans. Am. Math. Soc.,130, No. 1, 1–37 (1968).Google Scholar
  4. 4.
    V. D. Dzgoev, “On constructivizability of Boolean algebras,” All-Union Conference on Mathematical Logic, Kishinev, September 1976, Shtiintsa, 42 (1976).Google Scholar
  5. 5.
    V. L. Selivanov, “On the algorithmic complexity of algabraic systems,” Mat. Zametki,42, No. 6, 823–832 (1988).Google Scholar

Copyright information

© Plenum Publishing Corporation 1990

Authors and Affiliations

  • S. P. Odintsov
  • V. L. Selivanov

There are no affiliations available

Personalised recommendations