Algebra and Logic

, Volume 23, Issue 1, pp 36–55 | Cite as

Complete theories of unars

  • A. A. Ivanov


Mathematical Logic Complete Theory 
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.
    V. K. Kartashov, "Quasivarieties of unars," Mat. Zametki,27, No. 1, 7–20 (1980).Google Scholar
  2. 2.
    A. Ehrenfeucht, "Decidability of the theory of one function," Not. Am. Math. Soc.,6, 268 (1959).Google Scholar
  3. 3.
    M. O. Rabin, "Decidability of second-order theories and automata on infinite trees," Trans. Am. Math. Soc.,141, 1–35 (1969).Google Scholar
  4. 4.
    Yu. L. Ershov, Decision Problems and Constructivizable Models [in Russian], Nauka, Moscow (1980).Google Scholar
  5. 5.
    Yu. E. Shishmarëv, "On the categorical theories of one function," Mat. Zametki,11, No. 1, 89–98 (1972).Google Scholar
  6. 6.
    L. Marcus, "Minimal models of theories of one function symbol," Israel J. Math.,18, 117–131 (1974).Google Scholar
  7. 7.
    L. Marcus, "The number of countable models of theory of one unary function," Fund. Math.,108, No. 3, 171–181 (1980).Google Scholar
  8. 8.
    A. A. Ivanov, "Complete theories of a unary function," in: Proceedings of the Sixth All-Union Conference on Mathematical Logic [in Russian], Tbilisi (1982), p. 70.Google Scholar
  9. 9.
    A. Ehrenfeucht, "An application of games to the completeness problem for formalized theories," Fund. Math.,49, No. 2, 129–141 (1961).Google Scholar

Copyright information

© Plenum Publishing Corporation 1984

Authors and Affiliations

  • A. A. Ivanov

There are no affiliations available

Personalised recommendations