Year: 2021
Type: article
Abstract: This paper presents rules in sequent calculus for a binary quantifierIto formalise definite descriptions:Ix[F, G] means ‘TheFisG’. 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 ofI. 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 forIfor negative free and classical logic are also mentioned.
Source: Studia Logica
Author: Nils Kürbis
Institution: University of Łódź
Language: English
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,780
Funder: Alexander von Humboldt-Stiftung
OpenAlex ID: W3194036388