SearcharxivSearch

arXiv · 2012.08010

Expanding Belnap 2: the dual category in depth

Abstract

Bilattices, which provide an algebraic tool for simultaneously modelling knowledge and truth, were introduced by N.D. Belnap in a 1977 paper entitled 'How a computer should think'. Prioritised default bilattices include not only Belnap's four values, for `true' ($t$), `false'($f$), `contradiction' ($\top$) and `no information' ($\bot$), but also indexed families of default values for simultaneously modelling degrees of knowledge and truth. Prioritised default bilattices have applications in a number of areas including artificial intelligence. In our companion paper, we introduced a new family of prioritised default bilattices, $\mathbf J_n$, for $n \in \omega$, with $\mathbf J_0$ being Belnap's seminal example. We gave a duality for the variety $\mathcal V_n$ generated by $\mathbf J_n$, with the objects of the dual category $\mathcal X_n$ being multi-sorted topological structures. Here we study the dual category in depth. We give an axiomatisation of the category $\mathcal X_n$ and show that it is isomorphic to a category $\mathcal Y_n$ of single-sorted topological structures. The objects of $\mathcal Y_n$ are Priestley spaces endowed with a continuous retraction in which the order has a natural ranking. We show how to construct the Priestley dual of the underlying bounded distributive lattice of an algebra in $\mathcal V_n$ via its dual in $\mathcal Y_n$; as an application we show that the size of the free algebra $\mathbf F_{\mathcal V_n}(1)$ is given by a polynomial in $n$ of degree $6$.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew Craig, Brian A. Davey, Miroslav Haviar. 2020-12-14. Expanding Belnap 2: the dual category in depth. https://arxiv.org/abs/2012.08010

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