Related papers: Polynomial-time Tests for Difference Terms in Idem…
We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…
We extend the validity of Kiss's characterization of the commutator from congruence modular varieties to varieties with a difference term. This fixes a recently discovered gap in our paper [A finite basis theorem for difference-term…
In this paper, we study the notion of a separability idempotent in the C*-algebra framework. This is analogous to the notion in the purely algebraic setting, typically considered in the case of (finite-dimensional) algebras with identity,…
We investigate properties of varieties of algebras described by a novel concept of equation that we call \emph{commutator equation}. A commutator equation is a relaxation of the standard term equality obtained substituting the equality…
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…
Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…
We prove that a variety of algebras whose finitely generated members are free must be definitionally equivalent to the variety of sets, the variety of pointed sets, a variety of vector spaces over a division ring, or a variety of affine…
Eilenberg's variety theorem marked a milestone in the algebraic theory of regular languages by establishing a formal correspondence between properties of regular languages and properties of finite monoids recognizing them. Motivated by…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…
Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids. In the present paper this result is generalized to an abstract…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
In this paper we introduce a method of characteristic sets with respect to several term orderings for difference-differential polynomials. Using this technique, we obtain a method of computation of multivariate dimension polynomials of…
We prove that the variety V of commutative multiplicatively idempotent semirings satisfying x + y + xyz = x + y is generated by single semirings. Moreover, we describe a normal form system for terms in V and we show that the word problem in…
We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…
We prove that the finiteness of a finitely generated category of irreducible algebraic varieties over a field of characteristic zero is decidable. We also obtain a Burnside finiteness criterion for such a category, with applications to…