Core Concepts
Belnap-Dunn logic explores the interdefinability of expansions with classical connectives, shedding light on their relationships and definability. The author delves into the forgotten notion of defining connectives in logics, emphasizing the importance of understanding these relationships.
Abstract
The content discusses the interdefinability of expansions of Belnap-Dunn logic with classical connectives, focusing on defining connectives and exploring their relationships. It highlights the forgotten notion of defining connectives in logics and provides insights into the logical consequence relations and equivalence relations within these logics. The study showcases how various expansions are interconnected and how certain non-classical connectives can be defined within a framework of classical propositional logic.
Stats
For all A1, A2 ∈ FormBD: A1 ⇔BD A2 iff A1 |=BD A2, A2 |=BD A1, ¬A1 |=BD ¬A2, and ¬A2 |=BD ¬A1.
BD⊃,F ≃ BD∆; BD∆ ≃ BD◦∗; BD⊃,F ≃ BD◦∗.
∆ is definable in BD⊃,F; ◦∗ is definable in BD◦∗; ∗ is not definable in BD⊃,F.
F is definable in BD⊃,B,N,F; ◦ and ∗ are not definable in BD◦,∗.
Quotes
"The close relationship between their logical consequence relations is illustrated using a sound and complete sequent calculus proof system for BD⊃,F."
"Almost all publications that refer to the definability of connectives concern logics whose logical consequence relation is defined using a logical matrix."