Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2304.11621

Cut-free sequent-style systems for a logic associated to involutive Stone algebras

Liliana M. Cantú·Martín Figallo
View original source ↗Read source document ↗Export metadata ↓

Abstract

In \cite{LC, LCMF}, it was introduced a logic (called \Six ) associated to a class of algebraic structures known as {\em involutive Stone algebras}. This class of algebras, denoted by \Sto , was considered by the first time in \cite{CS1} as a tool for the study of certain problems connected to the theory of finite--valued \L ukasiewicz--Moisil algebras. In fact, \Six\ is the logic that preserves degrees of truth with respect to the class \Sto . Among other things, it was proved that \Six\ is a 6--valued logic that is a {\em Logic of Formal Inconsistency} (\LFI ); moreover, it is possible to define a consistency operator in terms of the original set of connectives. A Gentzen-style system (which does not enjoy the cut--elimination property) for \Six\ was given. Besides, in \cite{LCMF}, it was shown that \Six\ is matrix logic that is determined by a finite number of matrices; more precisely, four matrices. However, this result was further sharpened in \cite{SMUR} proving that just one of these four matrices determine \Six , that is, \Six\ can be determined by a single 6--element logic matrix. In this work, taking advantage of this last result, we apply a method due to Avron, Ben-Naim and Konikowska \cite{Avron02} to present different Gentzen systems for \Six\ enjoying the cut--elimination property. This allows us to draw some conclusions about the method as well as to propose additional tools for the streamlining process. Finally, we present a decision procedure for \Six\ based in one of these systems.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Liliana M. Cantú, Martín Figallo. 2023-04-23. Cut-free sequent-style systems for a logic associated to involutive Stone algebras. https://arxiv.org/abs/2304.11621

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↗