Skip to main content
SpringerLink
Log in

Turing machine computations in finitely axiomatizable theories

  • 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

Literature cited

  1. S. S. Goncharov and A. T. Nurtazin, "Constructive models of complete decidable theories," Algebra Logika,12, No. 2, 125–142 (1973).

    Google Scholar 

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

    Google Scholar 

  3. Yu. L. Ershov, The Theory of Numerations [in Russian], Novosibirsk (1974), p. 3.

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

  5. G. Keisler and C. C. Chen, Model Theory [Russian translation], Mir, Moscow (1977).

    Google Scholar 

  6. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965).

  7. M. G. Peretyat'kin, "Strongly constructivizable models and numerations of Boolean Algebras of recursive sets," Algebra Logika,10, No. 5, 535–557 (1971).

    Google Scholar 

  8. H. Rogers, Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).

    Google Scholar 

  9. A. Church, Introduction to Mathematical Logic [Russian translation], Inostr. Lit., Moscow (1960).

    Google Scholar 

  10. A. Ehrenfeucht, "An application of games to the completeness problem for formalizer theories," Fundam. Math.,49, 129–141 (1961).

    Google Scholar 

  11. L. Feiner, "Hierarchies of Boolean algebras," Symbolic Logic,35, 365–374 (1970).

    Google Scholar 

  12. H. Friedman, "One hundred and two problems in mathematical logic," J. Symbolic Logic,40, 113–129 (1975).

    Google Scholar 

  13. W. Hanf, "Model theoretic methods in the study of elementary logic," in: Symp. Theory of Models, North-Holland, Amsterdam (1965), pp. 113–145.

    Google Scholar 

  14. W. Hanf, "The Boolean algebra of logic," Bull. Am. Math. Soc.,31, No. 3, 587–589 (1975).

    Google Scholar 

  15. L. Harrington, "Recursively presented prime models," J. Symbolic Logic,39, 305–309 (1974).

    Google Scholar 

  16. J. A. Makowsky, "On some conjectures connected with complete sentences," Fundam. Math.,81, 193–202 (1974).

    Google Scholar 

  17. R. Robinson, "Undecidability and nonperiodicity for tilings of the plane," Invent. Math.,12, 177–209 (1971).

    Article  Google Scholar 

Download references

Authors
  1. M. G. Peretyat'kin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 21, No. 4, pp. 410–441, July–August, 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peretyat'kin, M.G. Turing machine computations in finitely axiomatizable theories. Algebra and Logic 21, 272–295 (1982). https://doi.org/10.1007/BF01980636

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation