Algebra and Logic

, Volume 30, Issue 4, pp 271–282 | Cite as

Semantically universal classes of models

  • M. G. Peretyat'kin


Mathematical Logic Universal Classis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature cited

  1. 1.
    W. Hanf, "Isomorphism in elementary logic," Notices Am. Math. Soc., No. 9, 146–147 (1962).Google Scholar
  2. 2.
    W. Hanf, "Primitive Boolean algebras," in: Proc. Symp. Honor Alfred Tarski (Barkeley, 1971), Proc. Symp. Pure Amer. Math. Soc., Providence, Rhode Island (1974), pp. 75–90.Google Scholar
  3. 3.
    W. Hanf, "The Boolean algebra of logic," Bull. Am. Math. Soc.,31, No. 3, 587–589 (1975).Google Scholar
  4. 4.
    M. G. Peretyat'kin, "Similarity of the properties of recursively enumerable and finitely axiomatizable theories," Dokl. Akad. Nauk SSSR,308, No. 4, 788–791 (1989).Google Scholar
  5. 5.
    M. G. Peretyat'kin, "Imbedding recursively enumerable theories in finitely axiomatizable theories," Tr. Inst. Mat. Sib. Otd. Akad. Nauk SSSR (1990).Google Scholar
  6. 6.
    M. G. Peretyatkin, "Disjunction phenomenon for L-universal classes," in: Intern. Colloq. Model Theory (abstracts), Karaganda (1990), pp. 42–43.Google Scholar
  7. 7.
    H. J. Keisler and C. C. Chang, Model Theory, North-Holland (1973).Google Scholar
  8. 8.
    H. Rodgers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).Google Scholar
  9. 9.
    Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).Google Scholar

Copyright information

© Plenum Publishing Corporation 1992

Authors and Affiliations

  • M. G. Peretyat'kin

There are no affiliations available

Personalised recommendations