Related papers: Kleene algebra with commutativity conditions is un…
We extend Kolchin's results on linear dependence over projective varieties in the constants, to linear dependence over arbitrary complete differential varieties. We show that in this more general setting, the notion of linear dependence…
There studed correspondence between symplectic leaves, irreducible representations and prime ideals, which is invariant with respect to quantum adjoint action. The Conjecture of De Concini-Kac-Procesi on dimensions of irreducible…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
We show that the classical algebra of quaternions is a commutative $\Z_2\times\Z_2\times\Z_2$-graded algebra. A similar interpretation of the algebra of octonions is impossible.
In this article we generalize Cobham theorem to a large class of substitutions including non primitive and non constant length substitutions.
We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…
We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…
It is known from Grzegorczyk's paper \cite{grze-1951} that the lattice of real semi-algebraic closed subsets of ${\mathbb R}^n$ is undecidable for every integer $n\geq 2$. More generally, if $X$ is any definable set over a real or…
The main result of this paper shows that if $\mathcal{M}$ is a consistent strong linear Maltsev condition which does not imply the existence of a cube term, then for any finite algebra $\mathbb{A}$ there exists a new finite algebra…
In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…
We consider the Clifford algebra and the Clifford group associated with any quadratic module, degenerate or not, over an arbitrary commutative ring with 1. We determine some of the important subalgebras of the Clifford algebra under some…
Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later and more recent work investigated intensional…
Let $p$ be a polynomial in several non-commuting variables with coefficients in a field $K$ of arbitrary characteristic. It has been conjectured that for any $n$, for $p$ multilinear, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by…
We give an elementary proof of the theorem which states that a finite unramified algebra over a discrete field is tracically \'etale. -- Nous donnons une d\'emonstration \'el\'ementaire du th\'eor\`eme selon lequel toute alg\`ebre nette sur…
We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…
We revisit Haiman's conjecture on the relations between characters of Kazdhan-Lusztig basis elements of the Hecke algebra over the symmetric group. The conjecture asserts that, for purposes of character evaluation, any Kazhdan-Lusztig basis…
We prove a conjecture of Kontsevich regarding the solutions of rank two recursion relations for non-commutative variables which, in the commutative case, reduce to rank two cluster algebras of affine type. The conjecture states that…
Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…
We show that it is undecidable whether a system of linear equations over the Laurent polynomial ring $\mathbb{Z}[X^{\pm}]$ admit solutions where a specified subset of variables take value in the set of monomials $\{X^z \mid z \in…