Skip to main content
Log in

Index Sets of Almost Prime Constructive Models

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

We study complexity of index sets of strongly constructive almost prime models, almost prime constructive models, and almost prime with strong constructivizations Bibliography: 14 titles.

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

Access this article

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. S. S. Goncharov and J. F. Knight, “Computable structure and non-structure theorems” [in Russian], Algebra Logika 41, No. 6, 639–681 (2002); English transl.: Algebra Logic 41, No. 6, 351–373 (2002).

    Article  MathSciNet  Google Scholar 

  2. A. T. Nurtazin, “Computable Classes and Algebraic Autostability Criteria” [in Russian], Thesis, Alma-Ata (1974).

  3. S. S. Goncharov and Yu. L. Ershov, Constructive Models [in Russian], Nauchnaya kniga (IDMI), Novosibirsk (1999); English transl.: Kluwer Academic/Plenum Press, New York (2002).

  4. C. C. Chang and H. J. Keisler, Model Theory, North-Holland, Amsterdam etc. (1990).

    MATH  Google Scholar 

  5. S. S. Goncharov, “Computability and computable models, mathematical problems from applied logic. II,” In: Logics for the XXIst Century, pp. 99–216, Springer, New York (2006).

    Google Scholar 

  6. E. B. Fokina, “Index sets of decidable models” [in Russian], Sib. Mat. Zh. 48, No. 5, 1167–1179 (2007); English transl.: Sib. Math. J. 48, No. 5, 939–948 (2007).

    Article  MathSciNet  Google Scholar 

  7. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    MATH  Google Scholar 

  8. E. N. Pavlovskii, “Estimation of the algorithmic complexity of classes of computable models” [in Russian], Sib. Mat. Zh. 49, No. 3, 635–649 (2008); English transl.: Sib. Math. J. 49, No. 3, 512–523 (2008).

    Article  MathSciNet  Google Scholar 

  9. E. N. Pavlovskii, “Index sets of simple models” [in Russian], Sib. Electr. Mat. Izv. 5, 200–210 (2008).

    MathSciNet  Google Scholar 

  10. S. S. Goncharov, “Problem of the number of non-self-equivalent constructivizations” [in Russian], Algebra Logika 19, No. 6, 621–639 (1980); English transl.: Algebra Logic 19, No. 6, 401–414 (1980).

    Article  MathSciNet  Google Scholar 

  11. A. T. Nurtazin, “Strong and weak constructivization and computable families” [in Russian], Algebra Logika 13, No. 3, 311–323 (1974); English transl.: Algebra Logic 13, No. 3, 177–184 (1974).

    Article  Google Scholar 

  12. Yu. L. Ershov and E. A. Palyutin, Matematical Logic [in Russian], Nauka, Moscow (1987).

    Google Scholar 

  13. S. S. Goncharov and A. T. Nurtazin, “Constructive models of complete solvable theories” [in Russian], Algebra Logika 12, No. 2, 125–142 (1973); English transl.: Algebra Logic 12, 67–77 (1974).

    Article  MATH  Google Scholar 

  14. S. S. Goncharov and M. Purmakhdian, “Iterated extensions of models of countable theories and their applications” [in Russian], Algebra Logika 34, No. 6, 623–645 (1995); English transl.: Algebra Logic 34, No. 6, 346–358 (1995).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. S. Goncharov.

Additional information

Translated from Vestnik Novosibirskogo Gosudarstvennogo Universiteta: Seriya Matematika, Mekhanika, Informatika 13, No. 3, 2013, pp. 38–52.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Goncharov, S.S. Index Sets of Almost Prime Constructive Models. J Math Sci 205, 355–367 (2015). https://doi.org/10.1007/s10958-015-2252-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-015-2252-5

Keywords

Navigation