Algebra and Logic

, Volume 32, Issue 6, pp 334–341 | Cite as

Strong constructibility of boolean algebras of elementary characteristic (1,1,0)

  • V. N. Vlasov
  • S. S. Goncharov
Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Yu. L. Ershov, “Constructive models,” in:Selected Problems in Algebra and Logic, III [in Russian], Nauka, Novosibirsk (1973).Google Scholar
  2. 2.
    N. G. Khisamiev, “Strongly constructive models of decidable theories,”Izv. Akad. Nauk KazSSR, Ser. Fiz.-Mat., 83–84 (1974).Google Scholar
  3. 3.
    Yu. L. Ershov,Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).Google Scholar
  4. 4.
    S. S. Goncharov,Countable Boolean Algebras [in Russian], Nauka, Novosibirsk (1988).Google Scholar
  5. 5.
    S. S. Goncharov, “Some properties of constructivizations of Boolean algebras,”Sib. Mat. Zh.,16, No. 2, 264–278 (1975).Google Scholar
  6. 6.
    S. S. Goncharov, “Restricted theories of constructive Boolean algebras,”Sib. Mat. Zh.,17, No. 4, 797–812 (1976).Google Scholar
  7. 7.
    S. P. Odintsov,Restrictions in the Theory of Constructive Boolean Algebras from the Lower Layer, Institute of Mathematics, Novosibirsk, Preprint No. 12 (1986).Google Scholar
  8. 8.
    J. B. Remmel, “Recursive isomorphism types of recursive Boolean algebras,”J. Symb. Logic,46, No. 3, 572–594 (1981).Google Scholar

Copyright information

© Plenum Publishing Corporation 1994

Authors and Affiliations

  • V. N. Vlasov
  • S. S. Goncharov

There are no affiliations available

Personalised recommendations