Search arXivSearch

arXiv · 2404.04347

Equivalence of multiset-based consequence relations

Abstract

The pioneering work of Blok and Jónsson 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érez, 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

Explore connections, maps & timelines

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

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO

Scott topologies on meet-continuous domains

We study Scott products and sobriety of countable meet-continuous domains, meaning meet-continuous dcpos without any additional continuity or least-element assumption. Using the complete-lattice test-family theorem of Xu and Ji, we prove finite-product equality for those domains that are $L$-dcpos, and for the weaker class whose principal ideals have suprema of all nonempty subsets. For an arbitrary family of nonempty countable meet-continuous $L$-dcpos, we prove that the Scott topology on the order product equals the product of the factor Scott topologies if and only if only finitely many factors lack a least element. We also establish sobriety under bounded completeness and under additional common-upper-bound conditions. Assuming square-product equality, sobriety is characterized by Scott closedness of common-upper-bound sections associated with irreducible Scott-closed sets, with an equivalent sequential formulation in the countable case. Two extraction lemmas extend to meet-semilattice dcpos. The finite-product and sobriety questions for general countable meet-continuous domains remain unresolved here.

math.LO

Randomized Borel $(2d+1)$-coloring of digraphs

Let $G$ be a Borel digraph with maximum out-degree $d \in \mathbb{N}$. We show that $G$ admits a random Borel $(2d+1)$-coloring for which every edge is almost surely not monochromatic. This gives a simpler proof of a recent result of Pelayo-Gómez: such a graph $G$ admits a measurable proper $(2d+1)$-coloring with respect to any Borel probability measure on $V(G)$. Our proof is an adaptation of Pelayo-Gómez's proof to the randomized Borel setting.

math.LO