SearcharxivSearch

arXiv · 1808.09636

Expanding Belnap: dualities for a new class of default bilattices

Abstract

Bilattices provide an algebraic tool with which to model simultaneously knowledge and truth. They were introduced by Belnap in 1977 in a paper entitled \emph{How a computer should think}. Belnap argued that instead of using a logic with two values, for `true' ($t$) and `false' ($f$), a computer should use a logic with two further values, for `contradiction' ($\top$) and `no information' ($\bot$). The resulting structure is equipped with two lattice orders, a \emph{knowledge order} and a \emph{truth order}, and hence is called a \emph{bilattice}. Prioritised default bilattices include not only values for `true' ($t_0$), `false' ($f_0$), `contradiction' and `no information', but also indexed families of default values, $t_1, \dots, t_n$ and $f_1, \dots, f_n$, for simultaneous modelling of degrees of knowledge and truth. We focus on a new family of prioritised default bilattices: $\mathbf J_n$, for $n \in \omega$. The bilattice $\mathbf J_0$ is precisely Belnap's seminal example. We address mathematical rather than logical aspects of our prioritised default bilattices. We obtain a single-sorted topological representation for the bilattices in the quasivariety $\mathcal J_n$ generated by $\mathbf J_n$, and separately a multi-sorted topological representation for the bilattices in the variety $\mathcal V_n$ generated by $\mathbf J_n$. Our results provide an interesting example where the multi-sorted duality for the variety has a simpler structure than the single-sorted duality for the quasivariety.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew Craig, Brian A. Davey, Miroslav Haviar. 2018-08-29. Expanding Belnap: dualities for a new class of default bilattices. https://arxiv.org/abs/1808.09636

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