Skip to main content
SpringerLink
Log in

A description of autostable models

  • Published:
Algebra and Logic Aims and scope

Abstract

Models that are uniformly autostable in various senses are studied. The general criterion of autostability is cited, and we argue that it cannot be transposed into a general sufficient condition of autostability. We establish model-theoretic criteria of autostability in degree 0′, both for the whole class of recursive models and some of its main subclasses.

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

Similar content being viewed by others

References

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  3. S. S. Goncharov, “The quantity of nonautoequivalent constructivizations”,Algebra Logika,16, No. 3, 257–282 (1977).

    MATH  Google Scholar 

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

    Google Scholar 

  5. C. J. Ash, “Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees”,Trans. Am. Math. Soc.,298, No. 2, 497–514 (1986).

    Article  MATH  Google Scholar 

  6. Yu. G. Ventsov, “Nonuniform autostability of models”,Algebra Logika,26, No. 6, 422–440 (1987).

    Article  MATH  Google Scholar 

  7. O. V. Kudinov, “Criteria of autostability for I-decidable models”,Algebra Logika,31, No. 5, 479–492 (1992).

    Google Scholar 

  8. Yu. G. Ventsov, “Constructive models of regularly infinite algorithmic dimension”,Algebra Logika,33, No. 2, 135–146 (1994).

    MATH  Google Scholar 

  9. O. V. Kudinov, “An autostable 1-decidable model without a computable Scott family of ∃-formulas”,Algebra Logika,35, No. 4, 458–467 (1996).

    Google Scholar 

  10. O. V. Kudinov, “Some properties of autostable models”,Algebra Logika,35, No. 6, 685–698 (1996).

    Google Scholar 

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

    Google Scholar 

  12. Yu. L. Ershov, Theory of Numerations [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  13. C. J. Ash and A. Nerode, “Intrinsically recursive relations”, inAspects of Effective Algebra, Proc. Conf. Monash Univ. (1981), pp. 26–41.

  14. C. J. Ash, “Categoricity in hyperarithmetical degrees”,Ann. Pure Appl. Log.,34, No. 1, 1–14 (1987).

    Article  MATH  Google Scholar 

  15. M. M. Arslanov, “Families of recursively enumerable sets and their undecidability degrees”,Izv. Vyssh. Uch. Zav., Mat., No. 4, 13–19 (1985).

    Google Scholar 

  16. B. M. Khusainov, “Strongly effective unars and nonautoequivalent constructivisations”, inSome Problems of Differential Equations and Discrete Mathematics [in Russian], NGU, Novosibirsk (1986), pp. 33–44.

    Google Scholar 

  17. V. V. Viugin, “On some examples of upper semilattices of computable numerations”,Algebra Logika,12, No. 5, 512–529 (1973).

    Google Scholar 

  18. S. A. Badaev, “Minimal numerations”, inMathematical Logic and Algorithm Theory, Trudy Inst. Mat. SO RAN, Vol. 25, (1993), pp. 3–34.

Download references

Authors
  1. O. V. Kudinov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by RFFR grant No. 096-01-01525.

Translated fromAlgebra i Logika, Vol. 36, No. 1, pp. 26–36, January–February, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kudinov, O.V. A description of autostable models. Algebr Logic 36, 16–22 (1997). https://doi.org/10.1007/BF02671950

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation