Skip to main content
SpringerLink
Log in

Effectively infinite classes of weak constructivizations of models

  • Published:
Algebra and Logic Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. C. J. Ash and A. Nerode, “Intrinsically recursive relations. Aspects of effective algebra,” in:Proc. Conf. Monash Univ., Australia (1981), pp. 24–41.

  2. C. J. Ash and J. F. Knight, “Pairs of recursive structure,”Logic Paper,64, 1–45 (1988).

    Google Scholar 

  3. C. J. Ash and S. S. Goncharov, “Strong Δ 02 -categoricity,”Algebra Logika,24, No. 6, 718–727 (1985).

    Google Scholar 

  4. S. S. Goncharov, “The problem of the number of nonequivalent constructivizations,”Algebra Logika,19, No. 6, 621–639 (1980).

    Google Scholar 

  5. S. S. Goncharov, “The number of nonequivalent constructivizations,”Algebra Logika,16, No. 3, 257–289 (1977).

    Google Scholar 

  6. S. S. Goncharov, “autostability and computable families of constructivizations,”Algebra Logika,14, No. 6, 647–680 (1975).

    Google Scholar 

  7. S. S. Goncharov, “Autostability of models and Abelian groups,”Algebra Logika,19, No. 1, 23–44 (1980).

    Google Scholar 

  8. S. S. Goncharov and V. D. Dzgoev, “Autostability of models,”Algebra Logika,19, No. 1, 45–58. (1980).

    Google Scholar 

  9. S. S. Goncharov, “Computable classes of constructivizations for models of finite type,”Sib. Mat. Zh.,34, No. 5, 23–37 (1993).

    Google Scholar 

  10. V. P. Dobritsa, “Computability of some classes of algebras,”Sib. Mat. Zh.,18, No. 3, 570–579 (1977).

    Google Scholar 

  11. V. P. Dobritsa, “Structural properties of computable classes of constructive models,”Algebra Logika,26, No. 1, 36–62 (1987).

    Google Scholar 

  12. A. T. Nurtazin, “Strong and weak constructivizations and computable families,”Algebra Logika,13, No. 3, 311–323 (1974).

    Google Scholar 

  13. S. S. Goncharov, “Bounded theories of constructive Boolean algebras,”Sib. Mat. Zh.,17, No. 4, 797–812 (1976).

    Google Scholar 

  14. S. S. Goncharov, “Some properties of constructivizations for Boolean algebras,”Sib. Mat. Zh.,16, No. 2, 264–278 (1975).

    Google Scholar 

  15. Yu. L. Ershov,Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

Download references

Authors
  1. S. S. Goncharov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the Russian Foundation for Fundamental Research, grant No. 93.01.1506.

Translated fromAlgebra i Logika, Vol. 32, No. 6, pp. 631–664, November–December, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goncharov, S.S. Effectively infinite classes of weak constructivizations of models. Algebr Logic 32, 342–360 (1993). https://doi.org/10.1007/BF02263053

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02263053

Keywords

Search

Navigation