Skip to main content
SpringerLink
Log in

An autostable 1-decidable model without a computable Scott family of ∃-formulas

  • Published:
Algebra and Logic Aims and scope

Abstract

We disprove the assumption that the existence of a computable Scott family of ∃-formulas with a finite tuple of parameters from a 1-decidable model is a necessary condition of its being autostable. Given a family S of general recursive functions, we construct a unar ms and find the family S for which ms is the desired counterexample.

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. O. V. Kudinov, “Criteria of autostability for 1-decidable models,”Algebra Logika,31, No. 5, 479–492 (1992).

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  4. Yu. L. Ershov,Numeration Theory [in Russian], Nauka, Moscow (1977).

    Google Scholar 

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

  6. I. Bucur and A. Deleanu,Introduction to the Theory of Categories and Functors, Pure Appl. Math.,19, Wiley, London (1968).

    Google Scholar 

  7. A. I. Mal'tsev,Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1986).

    Google Scholar 

  8. V. L. Selivanov, “Numerations of families of general recursive functions,”Algebra Logika,15, No. 2, 205–226 (1976).

    MATH  MathSciNet  Google Scholar 

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. 093-01-01506 and by ISF grant NQ6000.

Translated fromAlgebra i Logika, Vol. 35, No. 4, pp. 458–467, July–August, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kudinov, O.V. An autostable 1-decidable model without a computable Scott family of ∃-formulas. Algebr Logic 35, 255–260 (1996). https://doi.org/10.1007/BF02367027

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation