Related papers: Closures in Formal Languages and Kuratowski's Theo…
We investigate the equational theory of Kleene algebra terms with variable complements -- (language) complement where it applies only to variables -- w.r.t. languages. While the equational theory w.r.t. languages coincides with the language…
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…
A series of recent papers by Bergfalk, Lupini and Panagiotopoulus developed the foundations of a field known as `definable algebraic topology,' in which classical cohomological invariants are enriched by viewing them as groups with a Polish…
Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…
This article is an introduction to formal languages from the point of view of combinatorial group theory. Group theoretic applications are included and language classes are defined algebraically.
We define closed model category structures on different categories connected to the world of operad algebras over the category C(k) of (unbounded) complexes of k-modules: on the category of operads, on the category of algebras over a fixed…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
In this paper we extend of the notion of algebraically closed given in the case of groups and skew fields to an arbitrary h-inductive theory. The main subject of this paper is the study of the notion of positive algebraic closedness and its…
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the…
On any closed Riemannian manifold of dimension greater than $7$, we construct examples of background physical coefficients for which the Einstein-Lichnerowicz equation possesses a non-compact set of positive solutions. This yields in…
We show that, for each finite algebra A, either it has symmetric term operations of all arities or else some finite algebra in the variety generated by A has two automorphisms without a common fixed point. We also show this two-automorphism…
The clone of term operations of an algebraic structure consists of all operations that can be expressed by a term in the language of the structure. We consider bounds for the length and the height of the terms expressing these functions,…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
We generalize Kracht's theory of internal describability from classical modal logic to the family of all logics canonically associated with varieties of normal lattice expansions (LE algebras). We work in the purely algebraic setting of…
Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their…
Let A be a finitely generated associative algebra over an algebraically closed field. We characterize the finite dimensional modules over A whose orbit closures are regular varieties.
In constructive algebra one cannot in general decide the irreducibility of a polynomial over a field K. This poses some problems to showing the existence of the algebraic closure of K. We give a possible constructive interpretation of the…
Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…
The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…
We construct closed forms that generate with repetitions all Mersenne primes, respectively all Fermat primes, all twin-prime pairs and all Sophie Germain primes. Also, we construct closed forms that count all Mersenne primes between $0$ and…