Related papers: The algebra of non-deterministic programs: demonic…
We prove several de Finetti theorems for the unitary dual group, also called the Brown algebra. Firstly, we provide a finite de Finetti theorem characterizing $R$-diagonal elements with an identical distribution. This is surprising, since…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
We introduce a version of probabilistic Kleene algebra with angelic nondeterminism and a corresponding class of automata. Our approach implements semantics via distributions over multisets in order to overcome theoretical barriers arising…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
The present paper is devoted to the study of dimonoids, algebraic structures with two associative binary operations that satisfy a prescribed system of axioms. We investigate the properties of dual dimonoids. In the class of noncommutative…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean algebras, with special attention to quantifier-eliminations, complete axiomatizations and decidability. A classical example is the enrichment…
We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we consider cons-free programs of varying data orders, equipped with explicit non-deterministic choice.…
Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not all theoretical results have realized their promising…
We prove that two infinite p-adic semi-algebraic sets are isomorphic (i.e. there exists a semi-algebraic bijection between them) if and only if they have the same dimension.
By limiting the range of the predicate variables in a second-order language one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note we provide an infinitary strongly…
Multirelations provide a semantic domain for computing systems that involve two dual kinds of nondeterminism. This paper presents relational formalisations of Kleisli, Parikh and Peleg compositions and liftings of multirelations. These…
A connected component of an affine algebraic group is called periodic if all its elements have finite order. We give a characterization of periodic components in terms of automorphisms with finite number of fixed points. It is also…
We consider all 16 unary operations that, given a homogeneous binary relation R, define a new one by a boolean combination of xRy and yRx. Operations can be composed, and connected by pointwise-defined logical junctors. We consider the…
For a given extension $A \subset E$ of associative algebras we describe and classify up to an isomorphism all $A$-complements of $E$, i.e. all subalgebras $X$ of $E$ such that $E = A + X$ and $A \cap X = \{0\}$. Let $X$ be a given…
Although algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified through ternary operations. In this context, we introduce structures that contain two constants and a…
We provide a characterization of those relation algebras which are isomorphic to the algebras of compatible relations of some $\Z_2$-set. We further prove that this class is finitely axiomatizable in first-order logic in the language of…