Special cases of the interpolation theorem for classical predicate calculus
https://doi.org/10.22405/2226-8383-2024-25-2-222-234
Abstract
The article proves special cases of the interpolation theorem for the classical predicate calculus without functional symbols and equality. By imposing restrictions on the interpolated formulas, it is possible to prove the existence of an interpolant of a special kind: universal, existential, Horn and universal Horn. The most interesting case is the universal Horn interpolant: the axioms of many algebraic systems are given by universal Horn formulas. The results obtained
in this work can be useful both from the point of view of proof theory and in applications, for example, when solving problems of artificial intelligence and developing logical programming languages. The article is written in the spirit of proof theory, the main tools are sequential calculus and such techniques for proof transforming as reversing the applications of inference
rules, rearranging the applications of rules according to S. K. Kleene and weeding according to V.P.Orevkov.
The article consists of an introduction, the main part divided into 3 paragraphs, and a conclusion. The introduction contains a brief historical overview and discussion of the relevance of the work. In the first paragraph of the main part, the necessary definitions are introduced and the main result is formulated. The second paragraph is devoted to the description of the
sequential calculus KGL constructed by V. P. Orevkov. The third one is devoted to the proof of the main theorem. The conclusion contains a discussion of the results obtained and a brief overview of the prospects for further work.
About the Author
Dmitry Alekseevich CybulskiRussian Federation
postgraduate student
References
1. Craig, W. “Linear Reasoning. A New Form of the Herbrand–Gentzen Theorem”, Jour. symbolic
2. logic, vol. 22, pp. 250-268.
3. Lynon, R. C. “An Interpolation Theorem in the Predicate Calculus”, Pacific jour. math., vol. 9,
4. pp. 129-142.
5. Tayclin, M. A. “Abstract of Lyndon’s article”, Jour. symbolic logic., vol. 25, pp. 273-274.
6. Henkin, L. A. “An Extension of the Craig–Lyndon Interpolation Theorem”, Ibid., vol. 28, pp.
7. -216.
8. Sch¨utte, K. “Der Interpolationssatz der intuitionistischen Pr¨adikaten-logik”, Math. Ann., vol.
9. , pp. 192-200.
10. Maksimova, L. “Craig’s Theorem for Superintuitionistic Logics and Amalgamated Varieties of
11. Pseudo-Boolean Algebras”, Algebra and Logic, vol. 16:6, pp. 643-681.
12. Maksimova, L. “On Variable Separation in Modal and Superintuitionistic Logics”, Studia Logica, vol. 55, pp. 99-112.
13. Beth, E.W. “On Padoa’s Method in the Teory of Definition. Ibid., vol. 56, pp. 330-339.
14. Robinson, A. “A Result of Consistency and It’s Application to the Theory of Definition. Kon.
15. Ned. Akad., Amsterdam, Proc., Ser. A, vol. 59, pp. 47-58.
16. Kleene, S. C. “Mathematical Logic”, John Wiley & Sons, inc., 1967, New York, pp. 394-441.
17. Maltsev, A. I., 1970. “Algebraic Systems”, Nauka, Moscow, pp. 163-192.
18. Orevkov, V.P. “Upper Bounds of Inference Elongation When Eliminating Cuts”, Zapiski
19. nauchnykh seminarov POMI, vol. 137, pp. 87-98.
20. Orevkov, V.P. “On Glivenko’s Classes of Sequents”, Trudy ordena Lenina Matematicheskogo
21. Instituta Steklova, vol. 98, pp. 131-154.
22. Ershov, Yu. L., Paliutin, E. A., 1987. “Mathematical Logic”, Nauka, Moskov, pp. 209-214.
23. Gentzen, G. “Untersuchungen ¨uber das logische Schließen. I, II”, Math. Zeitschrift, vol. 39, pp. 176-210, 405-443.
24. Kleene, S. C. “Permutability of inferences in Gentzen’s caculi LK and LJ”, Memories of the Am. math. society, vol. 10, pp. 1-26.
Review
For citations:
Cybulski D.A. Special cases of the interpolation theorem for classical predicate calculus. Chebyshevskii Sbornik. 2024;25(2):222-234. (In Russ.) https://doi.org/10.22405/2226-8383-2024-25-2-222-234