Skip to main content
SpringerLink
Log in

Theorem proving in infinite herbrand domain

  • Brief Communication
  • Published:
Cybernetics and Systems Analysis 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

References

  1. C.L. Chang and R. Lee, Symbolic Logic and Mechanical Theorem Proving [Russian translation], Nauka, Moscow (1983).

    Google Scholar 

  2. Yu. Ya. Samokhvalov, “Reduction of the search space in logical derivation procedures,” Vestnik KGU, No. 7, 104–110 (1992).

Download references

Authors
  1. Y. Y. Samokhvalov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 185–187, May–June, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Samokhvalov, Y.Y. Theorem proving in infinite herbrand domain. Cybern Syst Anal 33, 456–458 (1997). https://doi.org/10.1007/BF02733080

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation