A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic

The method Krbis used to formalise definite descriptions with a binary quantifier I, such that Ix [F, G] indicates 'the F is G', is examined and improved upon in this work.Krbis 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.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2024-12-28
DOI
https://doi.org/10.4204/eptcs.415.5
Citations
1
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.36

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic

Yaroslav Petrukhin
1 citations
Electronic Proceedings in Theoretical Computer Science
Computability, Logic, AI Algorithms
0.36
article

A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic

Yaroslav Petrukhin
article en
1 citations

Abstract

The method Krbis used to formalise definite descriptions with a binary quantifier I, such that Ix [F, G] indicates 'the F is G', is examined and improved upon in this work.Krbis 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.

Electronic Proceedings in Theoretical Computer ScienceVol. 415
University of Łódź (PL)
European Commission
Openalex Percentile: Top 32%
Computability, Logic, AI Algorithms
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic — Yaroslav Petrukhin · Electronic Proceedings in Theoretical Computer Science (2024) | TGRS Research Map | TGRS