Related papers: Syntax for Split Preorders
The {\em spectrum} of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models. In this paper we show that when restricted to using only two variables, but allowing counting quantifiers, the…
Let $R$ be a commutative ring. A full additive subcategory $\C$ of $R$-modules is triangulated if whenever two terms of a short exact sequence belong to $\C$, then so does the third term. In this note we give a classification of…
We describe the problem of Sweedler's duals for bialgebras as essentially characterizing the domain of the transpose of the multiplication. This domain is the set of what could be called ``representative linear forms'' which are the…
Semantic Role Labeling (SRL) aims at recognizing the predicate-argument structure of a sentence and can be decomposed into two subtasks: predicate disambiguation and argument labeling. Prior work deals with these two tasks independently,…
For integers $e,\ell\geq 2$, the level $\ell$ Fock space has an $\mathfrak{sl}_\infty$-crystal structure arising from the action of a Heisenberg algebra, intertwining the $\widehat{\mathfrak{sl}_e}$-crystal. The vertices of these crystals…
We establish key connections between Green's $\cal J$- and $\cal L$-relations on a finite semigroup and the subduction relation defined on the image sets of an action of the same semigroup when it acts faithfully on a finite set. The…
Semantic role labeling (SRL) aims to discover the predicateargument structure of a sentence. End-to-end SRL without syntactic input has received great attention. However, most of them focus on either span-based or dependency-based semantic…
We introduce Bifurcation Logic, BL, which combines a basic classical modality with separating conjunction * together with its naturally associated multiplicative implication, that is defined using the modal ordering. Specifically, a formula…
We investigate finite right-distributive binary algebraic structures called shelves. We first use symbolic computations with Python to classify (up to isomorphism) all connected shelves with order less than six. We explore the group…
This paper presents an abstract, mathematical formulation of classical propositional logic. It proceeds layer by layer: (1) abstract, syntax-free propositions; (2) abstract, syntax-free contraction-weakening proofs; (3) distribution; (4)…
Let $[n]$ be a finite chain $\{1, 2, \ldots, n\}$, and let $\mathcal{LS}_{n}$ be the semigroup consisting of all isotone and order-decreasing partial transformations on $[n]$. Moreover, let $\mathcal{SS}_{n} = \{\alpha \in \mathcal{LS}_{n}…
In a first part, we are concerned with the relationships between polynomials in the two generators of the algebra of Heisenberg--Weyl, its Bargmann--Fock representation with differential operators and the associated one-parameter group.Upon…
The concurrent refinement algebra has been developed to support rely/guarantee reasoning about concurrent programs. The algebra supports atomic commands and defines parallel composition as a synchronous operation, as in Milner's SCCS. In…
Mitsch's natural partial order on the semigroup of binary relations is here characterised by equations in the theory of relation algebras. The natural partial order has a complex relationship with the compatible partial order of inclusion,…
Tasks that model the relation between pairs of tokens in a string are a vital part of understanding natural language. Such tasks, in general, require exhaustive pair-wise comparisons of tokens, thus having a quadratic runtime complexity in…
Motivated by Gentzen disjunction elimination rule in his Natural Deduction calculus and reading inequalities with meet in a natural way, we conceive a notion of distributivity for join-semilattices. We prove that it is equivalent to a…
The first steps towards linearisation of partial orders and equivalence relations are described. The definitions of partial orders and equivalence relations (on sets) are formulated in a way that is standard in category theory and that…
This paper gives insight into intriguing connections between two apparently unrelated theories: the theory of skein modules of 3-manifolds and the theory of representations of groups into special linear groups of 2 by 2 matrices. Let R be a…
This paper addresses the task of set prediction using deep feed-forward neural networks. A set is a collection of elements which is invariant under permutation and the size of a set is not fixed in advance. Many real-world problems, such as…
We call a finite, spanning set of a semi-simple real Lie algebra a distinguished set if it satisfies the following property: The Lie bracket of any two elements out of the set is, up to some constant, another element in the set; conversely,…