Displaying 201 – 220 of 2109

Showing per page

Atomary tolerances on finite algebras

Bohdan Zelinka (1996)

Mathematica Bohemica

A tolerance on an algebra is defined similarly to a congruence, only the requirement of transitivity is omitted. The paper studies a special type of tolerance, namely atomary tolerances. They exist on every finite algebra.

Axiomatization of quasigroups

Jonathan D.H. Smith (2006)

Discussiones Mathematicae - General Algebra and Applications

Quasigroups were originally described combinatorially, in terms of existence and uniqueness conditions on the solutions to certain equations. Evans introduced a universal-algebraic characterization, as algebras with three binary operations satisfying four identities. Now, quasigroups are redefined as heterogeneous algebras, satisfying just two conditions respectively known as hypercommutativity and hypercancellativity.

Axiomatizing omega and omega-op powers of words

Stephen L. Bloom, Zoltán Ésik (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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

Stephen L. Bloom, Zoltán Ésik (2010)

RAIRO - Theoretical Informatics and Applications

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.

Balanced congruences

Ivan Chajda, Günther Eigenthaler (2001)

Discussiones Mathematicae - General Algebra and Applications

Let V be a variety with two distinct nullary operations 0 and 1. An algebra 𝔄 ∈ V is called balanced if for each Φ,Ψ ∈ Con(𝔄), we have [0]Φ = [0]Ψ if and only if [1]Φ = [1]Ψ. The variety V is called balanced if every 𝔄 ∈ V is balanced. In this paper, balanced varieties are characterized by a Mal'cev condition (Theorem 3). Furthermore, some special results are given for varieties of bounded lattices.

Balanced d-lattices are complemented

Martin Goldstern, Miroslav Ploščica (2002)

Discussiones Mathematicae - General Algebra and Applications

We characterize d-lattices as those bounded lattices in which every maximal filter/ideal is prime, and we show that a d-lattice is complemented iff it is balanced iff all prime filters/ideals are maximal.

Binary relations on the monoid of V-proper hypersubstitutions

Klaus Denecke, Rattana Srithus (2006)

Discussiones Mathematicae - General Algebra and Applications

In this paper we consider different relations on the set P(V) of all proper hypersubstitutions with respect to a given variety V and their properties. Using these relations we introduce the cardinalities of the corresponding quotient sets as degrees and determine the properties of solid varieties having given degrees. Finally, for all varieties of bands we determine their degrees.

Currently displaying 201 – 220 of 2109