Abstract
This paper presents a way of formalising definite descriptions with a binary quantifier ι, where ιx[F, G] is read as ‘The F is G’. Introduction and elimination rules for ι in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form ιx[F, G] are given, and it is shown that deductions in the system can be brought into normal form.
Original language | English |
---|---|
Pages (from-to) | 81-97 |
Number of pages | 17 |
Journal | Bulletin of the Section of Logic |
Volume | 48 |
Issue number | 2 |
DOIs | |
Publication status | Published - 12 Aug 2019 |
Keywords
- Definite descriptions
- Natural deduction
- Negative intuitionist free logic
- Normalization