SearcharxivSearch

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-09-04. 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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO