Abstract
The question of the existence of a decidable algorithm for the following three deductive theories, constructed on the basis of constructive predicate calculus, is considered herein.
The results of this note were presented to the Leningrad Seminar on Mathematical Logic on June 17, 1966.
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
Shanin, N. A., “On constructive comprehension of mathematical judgments (in Russian), Trudy Steklov Mat. Inst. Akad. Nauk SSSR, 52:226–311 (1958).
Lifshits, V. A., “Deductive validity and reduction classes,” this volume, p. 27.
Maslov, S. Yu., Mints, G. E., and Orevkov, V. P., “Undecidability in constructive predicate calculus of some classes of formulas containing only single-place predicate variables,” Doklady Akad. Nauk SSSR, 163(2):295–297 (1965).
Editor information
Rights and permissions
Copyright information
© 1969 Consultants Bureau
About this chapter
Cite this chapter
Lifshits, V.A. (1969). Problem of Decidability for Some Constructive Theories of Equalities. 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_8
Download citation
DOI: https://doi.org/10.1007/978-1-4684-8968-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-8970-5
Online ISBN: 978-1-4684-8968-2
eBook Packages: Springer Book Archive