The most natural paradefinite logic relative to classical logic
By: C. A. Middelburg
Potential Business Impact:
Lets computers handle confusing or missing information.
A paradefinite logic is a logic that can serve as the underlying logic for theories that are inconsistent or incomplete. A well-known paradefinite logic is Belnap-Dunn logic. Various expansions of Belnap-Dunn logic have been studied in the literature. In this note, it is argued that the most natural paradefinite logic relative to classical logic is the expansion of Belnap-Dunn logic with a falsity connective and an implication connective for which the standard deduction theorem holds.
Similar Papers
Paraconsistent Constructive Modal Logic
Logic in Computer Science
Helps computers think about things that are both true and false.
Four imprints of Belnap's useful four-valued logic in computer science
Logic in Computer Science
Links different computer ideas together.
Bilateralist base-extension semantics with incompatible proofs and refutations
Logic in Computer Science
Keeps math proofs from being wrong.