Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.00481 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910769061298176 |
|---|---|
| author | Petrukhin, Yaroslav |
| author_facet | Petrukhin, Yaroslav |
| contents | The method Kürbis used to formalise definite descriptions with a binary quantifier I, such that I$x[F,G]$ indicates `the F is G', is examined and improved upon in this work. Kürbis first looked at I in intuitionistic logic and its negative free form. It is well-known that intuitionistic reasoning approaches truth constructively. We also want to approach falsehood constructively, in Nelson's footsteps. Within the context of Nelson's paraconsistent logic N4 and its negative free variant, we examine I. We offer an embedding function from Nelson's (free) logic into intuitionistic (free) logic, as well as a natural deduction system for Nelson's (free) logic supplied with I and Kripke style semantics for it. Our method not only yields constructive falsehood, but also provides an alternate resolution to an issue pertaining to Russell's interpretation of definite descriptions. This comprehension might result in paradoxes. Free logic, which is often used to solve this issue, is insufficiently powerful to produce contradictions. Instead, we employ paraconsistent logic, which is made to function in the presence of contradicting data without devaluing the process of reasoning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_00481 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic Petrukhin, Yaroslav Logic in Computer Science The method Kürbis used to formalise definite descriptions with a binary quantifier I, such that I$x[F,G]$ indicates `the F is G', is examined and improved upon in this work. Kürbis first looked at I in intuitionistic logic and its negative free form. It is well-known that intuitionistic reasoning approaches truth constructively. We also want to approach falsehood constructively, in Nelson's footsteps. Within the context of Nelson's paraconsistent logic N4 and its negative free variant, we examine I. We offer an embedding function from Nelson's (free) logic into intuitionistic (free) logic, as well as a natural deduction system for Nelson's (free) logic supplied with I and Kripke style semantics for it. Our method not only yields constructive falsehood, but also provides an alternate resolution to an issue pertaining to Russell's interpretation of definite descriptions. This comprehension might result in paradoxes. Free logic, which is often used to solve this issue, is insufficiently powerful to produce contradictions. Instead, we employ paraconsistent logic, which is made to function in the presence of contradicting data without devaluing the process of reasoning. |
| title | A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2501.00481 |