Skip to main content
Log in

Certain questions on n-th order languages. II

  • Published:
Cybernetics Aims and scope

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.

Literature Cited

  1. Kh. Andreka, T. Gergei, and I. Nemeti, “Certain questions on n-th order languages. I,” Kibernetika, No. 5 (1974).

  2. P. M. Cohn, Universal Algebra, Harper and Row, London (1965).

    Google Scholar 

  3. H. B. Enderton, A Mathematical Introduction to Logic, Academic Press, New York (1971).

    Google Scholar 

  4. T. Pertrzykowski, “A complete mechanization of second-order type theory,” J. ACM, 20, No. 2 (1973).

  5. J. A. Robinson, “Mechanizing higher-order logic,” Machine Intelligence,4 (1969).

  6. J. L. Darlington, “A partial mechanization of second-order logic,” Machine Intelligence,6 (1971).

  7. Kh. Andreka, T. Gergei, and I. Nemeti, “Problem-oriented hierarchy of languages and logic of arrangements (in Hungarian),” KFKI-72-46 (1972).

  8. A. M. Mal'tsev, Algebraic Systems [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  9. L. Henkin, I. O. Monk, and A. Tarski, Cylindric Algebras, North Holland, London (1971).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 6, pp. 79–83, November–December, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andrejka, H., Gergely, T. & Nemethy, I. Certain questions on n-th order languages. II. Cybern Syst Anal 10, 1003–1008 (1974). https://doi.org/10.1007/BF01069444

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation