A note on drastic product logic

Stefano Aguzzoli; Matteo Bianchi; Diego Valota

Home/Archive/arXiv

arXiv · 1406.7166

A note on drastic product logic

Stefano Aguzzoli·Matteo Bianchi·Diego Valota

View original source ↗Read source document ↗Export metadata ↓

Abstract

The drastic product $*_D$ is known to be the smallest $t$-norm, since $x *_D y = 0$ whenever $x, y < 1$. This $t$-norm is not left-continuous, and hence it does not admit a residuum. So, there are no drastic product $t$-norm based many-valued logics, in the sense of [EG01]. However, if we renounce standard completeness, we can study the logic whose semantics is provided by those MTL chains whose monoidal operation is the drastic product. This logic is called ${\rm S}_{3}{\rm MTL}$ in [NOG06]. In this note we justify the study of this logic, which we rechristen DP (for drastic product), by means of some interesting properties relating DP and its algebraic semantics to a weakened law of excluded middle, to the $\Delta$ projection operator and to discriminator varieties. We shall show that the category of finite DP-algebras is dually equivalent to a category whose objects are multisets of finite chains. This duality allows us to classify all axiomatic extensions of DP, and to compute the free finitely generated DP-algebras.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Stefano Aguzzoli, Matteo Bianchi, Diego Valota. 2014-06-27. A note on drastic product logic. https://arxiv.org/abs/1406.7166

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↗