Skip to main content
SpringerLink
Log in

A variant of Herbrand's theorem for formulas in prenex form

  • Published:
Cybernetics 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. J. Herbrand, “Recherches sur la théorie de la démonstration,” Travaux de la Société des Sciences et de Lettres de Varsovie, class III, sciences mathematiques et physicques, Vol. 33 (1930).

  2. G. E. Mints [Minc], “Herbrand's theorem”, in: Mathematical Theory of Logical Inference [in Russian], Nauka, Moscow (1967), pp. 311–350.

    Google Scholar 

  3. J. Shoenfield, Mathematical Logic, Addison-Wesley, Reading, Massachusetts (1967).

    Google Scholar 

  4. J. Robinson, “A machine-oriented logic based on the resolution principle,” J. ACM,10, 163–174 (1963).

    Google Scholar 

  5. D. Pravitz, “Advances and problems in the development of mechanical proving procedures,” Kibern. Sb., Nov. Ser., No. 9, 52–65 (1972).

    Google Scholar 

Download references

Authors
  1. A. V. Lyaletskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 112–116, January–February, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lyaletskii, A.V. A variant of Herbrand's theorem for formulas in prenex form. Cybern Syst Anal 17, 125–129 (1981). https://doi.org/10.1007/BF01307049

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation