Skip to main content
SpringerLink
Log in

Semantic universality of theories over a superlist

  • 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. M. G. Peretyat'kin, "Similarity of properties of recursively enumerable and finitely axiomatizable theories," Dokl. Akad. Nauk SSSR,308, No. 4, 788–791.

  2. M. G. Peretyat'kin, "Immersing recursively enumerable theories in finitely axiomatizable ones," Tr. Inst. Mat. Akad. Nauk SSSR (1991).

  3. M. G. Peretyat'kin, "Semantically universal classes of models," Algebra Logika,30, No. 4, 414–431 (1991).

    Google Scholar 

  4. C. C. Chang and H. J. Keisler, Model Theory, 2nd edn., North Holland (1977).

  5. H. Rogers, Theory of Recursive Functions and Effective Computability, MIT Press (1987).

  6. R. I. Soare, Recursively Enumerable Sets and Degrees, Springer-Verlag (1987).

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

    Google Scholar 

  8. J. Shoenfield, Mathematical Logic [Russian translation], Nauka, Moscow (1975).

    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. 31, No. 1, pp. 47–73, January–February, 1992.

Translated by O. Bessonova

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peretyat'kin, M.G. Semantic universality of theories over a superlist. Algebr Logic 31, 30–48 (1992). https://doi.org/10.1007/BF02259856

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation