Search arXivSearch

arXiv · 2309.01449

Knowledge and ignorance in Belnap--Dunn logic

Abstract

In this paper, we argue that the usual approach to modelling knowledge and belief with the necessity modality $\Box$ does not produce intuitive outcomes in the framework of the Belnap--Dunn logic ($\mathsf{BD}$, alias $\mathsf{FDE}$ -- first-degree entailment). We then motivate and introduce a non\-standard modality $\blacksquare$ that formalises knowledge and belief in $\mathsf{BD}$ and use $\blacksquare$ to define $\bullet$ and $\blacktriangledown$ that formalise the \emph{unknown truth} and ignorance as \emph{not knowing whether}, respectively. Moreover, we introduce another modality $\mathbf{I}$ that stands for \emph{factive ignorance} and show its connection with $\blacksquare$. We equip these modalities with Kripke-frame-based semantics and construct a sound and complete analytic cut system for $\mathsf{BD}^\blacksquare$ and $\mathsf{BD}^\mathbf{I}$ -- the expansions of $\mathsf{BD}$ with $\blacksquare$ and $\mathbf{I}$. In addition, we show that $\Box$ as it is customarily defined in $\mathsf{BD}$ cannot define any of the introduced modalities, nor, conversely, neither $\blacksquare$ nor $\mathbf{I}$ can define $\Box$. We also demonstrate that $\blacksquare$ and $\mathbf{I}$ are not interdefinable and establish the definability of several important classes of frames using $\blacksquare$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniil Kozhemiachenko, Liubov Vashentseva. 2023-11-05. Knowledge and ignorance in Belnap--Dunn logic. https://doi.org/10.1093/jigpal%2Fjzad027

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO