Abstract
AbstractWe present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known drawbacks and treats definite description as genuine terms. A constructive proof of the cut elimination theorem and a Henkin-style proof of completeness are the main results of this contribution.
Publisher
Springer Nature Switzerland
Reference35 articles.
1. Artale, A., Mazzullo, A., Ozaki, A., Wolter, F.: On free description logics with definite descriptions. In: Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, pp. 63–73. IJCAI Organization (2021)
2. Beeson, M.: Foundations of Constructive Mathematics. Springer (1985). https://doi.org/10.1007/978-3-642-68952-9
3. Benzmüller, C., Scott, D.S.: Automating free logic in HOL, with an experimental application in category theory. J. Autom. Reason. 64, 53–72 (2020)
4. Blumson, B.: Anselm’s God in Isabelle/HOL URL (2020). https://www.isa-afp.org/browser_info/current/AFP/AnselmGod/document.pdf
5. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);B Bohrer,2019