SearcharxivSearch

arXiv · 2304.11626

On the logic that preserves degrees of truth associated to involutive Stone algebras

Abstract

Involutive Stone algebras (or {\bf S}--algebras) were introduced by R. Cignoli and M. Sagastume in connection to the theory of $n$-valued \L ukasiewicz--Moisil algebras. In this work we focus on the logic that preserves degrees of truth associated to involutive Stone algebras, named {\bf \em Six}. This follows a very general pattern that can be considered for any class of truth structure endowed with an ordering relation, and which intends to exploit many--valuedness focusing on the notion of inference that results from preserving lower bounds of truth values, and hence not only preserving the value $1$. Among other things, we prove that {\bf \em Six} is a many--valued logic (with six truth values) that can be determined by a finite number of matrices (four matrices). Besides, we show that {\bf \em Six} is a paraconsistent logic. Moreover, we prove that it is a genuine LFI (Logic of Formal Inconsistency) with a consistency operator that can be defined in terms of the original set of connectives. Finally, we study the proof theory of {\bf \em Six} providing a Gentzen calculus for it, which is sound and complete with respect to the logic.

Explore related subjects

Keep this discovery

BibTeXRIS

Liliana M. Cantú, Martín Figallo. 2023-04-23. On the logic that preserves degrees of truth associated to involutive Stone algebras. https://arxiv.org/abs/2304.11626

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