Related papers: A Note On Square-free Sequences and Anti-unificati…
We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…
A semigroup A is an abelian semigroup with identity 0. A set of positives in A is an ordered down-directed set P containing with every r an element r/2 with r/2 + r/2 = r. A continuity space is an abstract set X equipped with a map d : XxX…
A universal sequence for a group or semigroup $S$ is a sequence of words $w_1, w_2, \ldots$ such that for any sequence $s_1, s_2, \ldots\in S$, the equations $w_n = s_n$, $n\in \mathbb{N}$, can be solved simultaneously in $S$. For example,…
We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…
We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares…
Interest in anti-unification, the dual problem of unification, is on the rise due to applications within the field of software analysis and related areas. For example, anti-unification-based techniques have found uses within clone detection…
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…
Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what…
The concept of uniform interpolant for a quantifier-free formula from a given formula with a list of symbols, while well-known in the logic literature, has been unknown to the formal methods and automated reasoning community for a long…
A \emph{square} is a finite non-empty word consisting of two identical adjacent blocks. A word is \emph{square-free} if it does not contain a square as a factor. In any finite word one may delete the repeated block of a square, obtaining…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
We show that for algebraic groups over local fields of characteristic zero, the following are equivalent: Every homomorphism has a closed image, every unitary representation decomposes into a direct sum of finite-dimensional and mixing…
Words whose three successive factors of the same length are all different i.e. 3-anti-power words are a natural extension of square-free words (two successive factors of the same length are different). We give a way to verify whether a…
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…
It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…
A little-known and highly economical characterization of the real interval [0, 1], essentially due to Freyd, states that the interval is homeomorphic to two copies of itself glued end to end, and, in a precise sense, is universal as such.…
We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a…
In this article, we introduce the idempotentization process, which bears some philosophical and mathematical similarities with modern analytification and tropicalization. Idempotentization associates to any affine scheme an idempotent…
Given $\alpha_1,...,\alpha_m \in (0,1)$, we characterize all integrable functions $f:[0,1]^m \to \mathbb{C}$ satisfying $\int_{A_1 \times ...\times A_m} f =0$ for any collection of disjoint sets $A_1,...,A_m \subseteq [0,1]$ of respective…
This note will present a new proof of the fact that every uniformly bounded group of invertible elements in a finite von Neumann algebra is similar to a unitary group. The proof involves metric geometric arguments in the non-positively…