Related papers: Predicate Transformers, (co)Monads and Resolutions

In this paper we consider several problems of joint similarity to tuples of bounded linear operators in noncommutative polydomains and varieties associated with sets of noncommutative polynomials. We obtain analogues of classical results…

Let $A$ be a commutative and unital $\mathbb{R}$-algebra, and $M$ be an Archimedean quadratic module of $A$. We define a submultiplicative seminorm $\|\cdot\|_M$ on $A$, associated with $M$. We show that the closure of $M$ with respect to…

Formal power series come up in several areas such as formal language theory , algebraic and enumerative combinatorics, semigroup theory, number theory etc. This paper focuses on the set x R[[x]] consisting of formal power series with zero…

We introduce the resolvent composition, a monotonicity-preserving operation between a linear operator and a set-valued operator, as well as the proximal composition, a convexity-preserving operation between a linear operator and a function.…

Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations,…

This paper uses monads and comonads to establish a certain type of equivalence between two subcategories, one reflective and one coreflective, in a category whose objects represent compactifications of non-compact locally compact Hausdorff…

We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive normal form with the property that unit propagation on the…

The study is motivated by the known fact that, in the noncompact case, the main minimum-problem of the theory of interior capacities of condensers in a locally compact space is in general unsolvable, and this occurs even under very natural…

We study implicit reasoning, i.e. the ability to combine knowledge or rules within a single forward pass. While transformer-based large language models store substantial factual knowledge and rules, they often fail to compose this knowledge…

We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For…

This is a pedagogical and (almost) self-contained introduction into the theorem of Groenewold and van Howe, which states that a naive transcription of Dirac's quantisation rules cannot work. Some related issues in quantisation theory are…

We study the concept of idempotence for relative monads, which exhibits several subtleties not present for non-relative monads. In particular, there is a bifurcation of notions of idempotence in the relative setting, which are…

We introduce the notion of 'centre' for pomonoid-graded strong monads which generalizes some previous work that describes the centre of (not graded) strong monads. We show that, whenever the centre exists, this determines a pomonoid-graded…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…

Abstract. This article determines relations between two notions concerning monoids: factorability structure, introduced to simplify the bar complex; and quadratic normalisation, introduced to generalise quadratic rewriting systems and…

We prove some unconditional cases of the Existential Closedness problem for the modular $j$-function. For this, we show that for any finitely generated field we can find a "convenient" set of generators. This is done by showing that in any…