A characterization of quasivarieties of partial algebras by means of limits and products.
A deductive calculus for conditional equational systems with built-in predicates as premises.
A fully equational proof of Parikh’s theorem
We show that the validity of Parikh’s theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of -term equations of continuous commutative idempotent semirings.
A Fully Equational Proof of Parikh's Theorem
We show that the validity of Parikh's theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of μ-term equations of continuous commutative idempotent semirings.
A new proof of Reiterman's theorem
A normal form for restricted exponential functions
A note on Sugihara algebras.
In [4] Blok and Pigozzi prove syntactically that RM, the propositional calculus also called R-Mingle, is algebraizable, and as a consequence there is a unique quasivariety (the so-called equivalent quasivariety semantics) associated to it. In [3] it is stated that this quasivariety is the variety of Sugihara algebras. Starting from this fact, in this paper we present an equational base for this variety obtained as a subvariety of the variety of R-algebras, found in [7] to be associated in the same...
A notion of functional completeness for first order structures. II: Quasiprimality.
A notion of functional completeness for first-order structure.
A property of the solvable radical in finitely decidable varieties
It is shown that in a finitely decidable equational class, the solvable radical of any finite subdirectly irreducible member is comparable to all congruences of the irreducible if the type of the monolith is 2. In the type 1 case we establish that the centralizer of the monolith is strongly solvable.
A representation theorem for Post-like algebras
A scoop from groups: equational foundations for loops
Groups are usually axiomatized as algebras with an associative binary operation, a two-sided neutral element, and with two-sided inverses. We show in this note that the same simplicity of axioms can be achieved for some of the most important varieties of loops. In particular, we investigate loops of Bol-Moufang type in the underlying variety of magmas with two-sided inverses, and obtain ``group-like'' equational bases for Moufang, Bol and C-loops. We also discuss the case when the inverses are only...
A ternary variety generated by lattices
Affine spaces as models for regular identities
In [7] and [8], two sets of regular identities without finite proper models were introduced. In this paper we show that deleting one identity from any of these sets, we obtain a set of regular identities whose models include all affine spaces over GF(p) for prime numbers p ≥ 5. Moreover, we prove that this set characterizes affine spaces over GF(5) in the sense that each proper model of these regular identities has at least 13 ternary term functions and the number 13 is attained if and only if the...
Axiomatizing omega and omega-op powers of words
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.
Axiomatizing omega and omega-op powers of words
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.