SearcharxivSearch

arXiv · 2404.04347

Equivalence of multiset-based consequence relations

Abstract

The pioneering work of Blok and J\'onsson and its further development by Galatos and Tsinakis initiated an abstract study of consequence relations using the tools of module theory, where consequence relations over all types of syntactic objects are put on an equal footing. However, the assumption that in a consequence relation the premises form merely a set, as opposed to a more complicated structure, is still retained. An attempt to extend this framework to account for inferentially substructural generalizations of consequence relations, where the premises have the structure of a finite multiset, was recently made by Cintula, Gil-F\'erez, Moraschini, and Paoli. In this paper, we develop a different inferentially substructural generalization of the work of Galatos and Tsinakis, where we instead assume that the premises have the structure of a set of finite multisets. This leads a somewhat smoother framework which, unlike that of Cintula et al., covers the original theory of Galatos and Tsinakis as a special case.

Explore related subjects

Keep this discovery

BibTeXRIS

Ali Madanshekaf, Adam Přenosil, Zeinab Khanjanzadeh Seresti, Constantine Tsinakis. 2024-04-05. Equivalence of multiset-based consequence relations. https://arxiv.org/abs/2404.04347

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