Abstract
It is known how useful an apparatus the G. Gentzen [1] fundamental theorem turns out to be in investigations concerning predicate calculus. The plan of a finite proof of the possibility of extending the fundamental theorem to predicate calculus with equality and functional symbols is proposed herein. In the course of the proof we shall establish several theorems on specialization of the form of the deduction in some sequential versions of the predicate calculus with equality and functional symbols which are free of sections. In themselves, these results turn out to be useful for the proof of a number of assertions connected with the predicate calculus with equality and functional symbols.
The main results of this note were presented to the Leningrad Seminar on Mathematical Logic on November 18, 1964.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Literature Cited
Gentzen, G., “Untersuchungen über das logische Schliessen. I,” Math. Z, 39(2):176–210 (1934).
Kanger, S., “A simplified proof method for elementary logic,” in: Computer Programming and Formal Systems. Studies in Logic, 1963, pp. 87–94.
Editor information
Rights and permissions
Copyright information
© 1969 Consultants Bureau
About this chapter
Cite this chapter
Lifshits, V.A. (1969). Normal Form for Deductions in Predicate Calculus with Equality and Functional Symbols. In: Slisenko, A.O. (eds) Studies in Constructive Mathematics and Mathematical Logic. Seminars in Mathematics, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-8968-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4684-8968-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-8970-5
Online ISBN: 978-1-4684-8968-2
eBook Packages: Springer Book Archive