This is a preview of subscription content, log in via an institution to check access.
References
C.-L. Chang and R. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York (1973).
A. I. Degtyarev and A. A. Voronkov, “Equality control methods in mechanical theorem proving,” Kibernetika, No. 1, 34–41 (1986).
F. V. Anufriev and Z. M. Asel'derov, “Obviousness algorithm,” Kibernetika, No. 5, 29–60 (1972).
W. W. Bledsoe, “Non-resolution theorem proving,” Artif. Intell.,9, 1–35 (1977).
W. Bibel, Automated Theorem Proving, Vieweg Verlag, Berlin (1982).
A. A. Voronkov, “A proof-search method for first-order logic,” Int. Conf. on Computer Logic, Tallin (1988).
V. I. Mart'yanov, “On the method of invariant transformations,” Mat. Zametki,36, No. 6, 571–581 (1984).
A. V. Mantsivoda, FLENG: Functional-Logic Programming Language [in Russian], Preprint, IGU, Irkutsk (1990).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 163–170, January–February, 1993.
Rights and permissions
About this article
Cite this article
Mantsivoda, A.V. M-calculus — a sequent method for automatic theorem proving. Cybern Syst Anal 29, 130–136 (1993). https://doi.org/10.1007/BF01130096
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01130096