Deduction with Non-referring Descriptions in Type-theoretic Partial Logic
| Authors | |
|---|---|
| Year of publication | 2025 |
| Type | Requested lectures |
| MU Faculty or unit | |
| Citation | |
| Description | The talk elaborates formal reasoning with possibly non-referring definite descriptions. Because of the complexity of natural language, the adopted framework captures (multi)modality, higher-order quantification, and hyperintensionality (e.g. propositional attitudes). But the talk focuses on logical management of partiality, esp. lack of reference, while the common semantic solution of non-reference by free logics (consisting in adoption of dummy values) is dismissed since the semantics of the present approach is algorithmic (procedural), not denotational. |