Kürbis, N;
(2021)
A Binary Quantifier for Definite Descriptions for Cut Free Free Logics.
Studia Logica
10.1007/s11225-021-09958-x.
(In press).
Preview |
Text
Kurbis_A Binary Quantifier for Definite Descriptions for Cut Free Free Logics_AOP.pdf - Published Version Download (365kB) | Preview |
Abstract
This paper presents rules in sequent calculus for a binary quantifier I to formalise definite descriptions: Ix[F, G] means ‘The F is G’. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of I. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions with a term forming operator. In the final section rules for I for negative free and classical logic are also mentioned.
| Type: | Article |
|---|---|
| Title: | A Binary Quantifier for Definite Descriptions for Cut Free Free Logics |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1007/s11225-021-09958-x |
| Publisher version: | https://doi.org/10.1007/s11225-021-09958-x |
| Language: | English |
| Additional information: | © 2021 Springer Nature Switzerland AG. This article is licensed under a Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/). |
| Keywords: | Definite descriptions, Free logic, Sequent calculus, Cut elimination |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL SLASH UCL > Provost and Vice Provost Offices > UCL SLASH > Faculty of Arts and Humanities UCL > Provost and Vice Provost Offices > UCL SLASH > Faculty of Arts and Humanities > Dept of Philosophy |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10133352 |
Archive Staff Only
 |
View Item |
