Algebra and Logic

, Volume 19, Issue 6, pp 401–414 | Cite as

Problem of the number of non-self-equivalent constructivizations

  • S. S. Goncharov


Mathematical Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    I. Bucur and A. Deleanu, Introduction to the Theory of Categories and Functors, Wiley-Interscience, New York (1968).Google Scholar
  2. 2.
    S. S. Goncharov, "Self-stability and computable Families of constructivizations," Algebra Logika,14, No. 6, 647–680 (1975).Google Scholar
  3. 3.
    S. S. Goncharov, "On the number of non-self-equivalent constructivizations," Algebra Logika,16, No. 3, 257–263 (1977).Google Scholar
  4. 4.
    S. S. Goncharov, "Non-self-equivalent constructivizations of Boolean algebras," Mat. Zametki,19, No. 6, 853–858 (1976).Google Scholar
  5. 5.
    V. P. Dobritsa, "On recursively enumerable classes of constructive extensions and self-stability of algebras," Sib. Mat. Zh.,16, No. 6, 1148–1156 (1975).Google Scholar
  6. 6.
    Yu. L. Ershov, Theory of Enumerations [in Russian], Nauka, Moscow (1977).Google Scholar
  7. 7.
    Yu. L. Ershov, Theory of Enumerations [in Russian], Vol. III, Novosibirsk (1974).Google Scholar
  8. 8.
    A. I. Mal'tsev, "Constructive models. I," Usp. Mat. Nauk,16, No. 3, 3–60 (1961).Google Scholar
  9. 9.
    A. I. Mal'tsev, "Strongly related models and recursively perfect algebras," Dokl. Akad. Nauk SSSR,145, No. 2, 276–279 (1962).Google Scholar
  10. 10.
    A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).Google Scholar
  11. 11.
    A. T. Nurtazin, "Strong and weak constructivizations and computable families," Algebra Logika,13, No. 3, 311–323 (1974).Google Scholar
  12. 12.
    A. T. Nurtazin, "Computable enumerations of classes and algebraic criteria of self-stability," Author's Abstract of Candidate's Thesis, Novosibirsk (1975).Google Scholar
  13. 13.
    M. G. Peretyat'kin, "Strongly constructive models and enumerations of Boolean algebra of recursive sets," Algebra Logika,10, No. 5, 535–537 (1971).Google Scholar
  14. 14.
    R. La Roche, "Recursively presented Boolean Algebras," Notices Am. Math. Soc.,24, No.46, 552 (1977).Google Scholar
  15. 15.
    C. C. Chang and H. K. Kaisler, Model Theory, 2nd ed., North-Holland, Amsterdam (1977).Google Scholar
  16. 16.
    S. S. Goncharov, "Computable one-valued enumerations," Algebra Logika,19, No. 5, 507–551 (1980).Google Scholar

Copyright information

© Plenum Publishing Corporation 1981

Authors and Affiliations

  • S. S. Goncharov

There are no affiliations available

Personalised recommendations