Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.19767

On Universally Free First-Order Extensions of Belnap-Dunn's Four-Valued Logic and Nelson's Paraconsistent Logic N4

Henrique Antunes·Abilio Rodrigues
View original source ↗Read source document ↗Export metadata ↓

Abstract

The aim of this paper is to introduce the logics FFDE and FN4, which are universally free versions of Belnap-Dunn's four-valued logic, also known as the logic of first-degree entailment (FDE), and Nelson's paraconsistent logic QN4 (N-). Both FDE and QN4 are suitable to be interpreted as information-based logics, that is, logics that are capable of representing the deductive behavior of possibly inconsistent and incomplete information in a database. Like QN4 and some non-free first-order extensions of FDE, FFDE and FN4 are endowed with Kripke-style variable domain semantics, which allows representing the dynamic aspect of information processing, that is, how a database receives new information over time, including information about new individuals. We argue, however, that FFDE and FN4 can better represent the development of inconsistent and incomplete information states (i.e., configurations of a database) over time than their non-free versions. First, because they allow for empty domains, which corresponds to the idea that a database may acknowledge no individual at all at an early stage of its development. Second, because they allow for empty names, which get interpreted as information about new individuals is inserted into the database. Also, both systems include an identity predicate that is interpreted along the same lines of the other logical operators, viz., in terms of independent positive and negative rules.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Henrique Antunes, Abilio Rodrigues. 2024-12-27. On Universally Free First-Order Extensions of Belnap-Dunn's Four-Valued Logic and Nelson's Paraconsistent Logic N4. https://arxiv.org/abs/2412.19767

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗