Varieties of idempotent groupoids with small clones
J. Gałuszka (1999)
Colloquium Mathematicae
Similarity:
We give an equational description of all idempotent groupoids with at most three essentially n-ary term operations.
Displaying similar documents to “A characterization of modular lattices”
Varieties of idempotent groupoids with small clones
The minimal extension of sequences III. On problem 16 of Grätzer and Kisielewicz
J. Dudek (1996)
Colloquium Mathematicae
Similarity:
The main result of this paper is a description of totally commutative idempotent groupoids. In particular, we show that if an idempotent groupoid (G,·) has precisely m ≥ 2 distinct essentially binary polynomials and they are all commutative, then G contains a subgroupoid isomorphic to the groupoid described below. In [2], this fact was proved for m = 2.
Pointwise and global sums and negatives of binary relations.
Glavosits, Tamás, Száz, Árpád (2002)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
On the theory of cuts in ordered fields.
Pestov, G.G. (2001)
Sibirskij Matematicheskij Zhurnal
Similarity:
Skew elements in -semigroups.
Petrescu, Adrian (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Reg-strongly solid varieties of commutative semigroups
Sarawut Phuapong, Sorasak Leeratanavalee (2011)
Matematički Vesnik
Similarity:
The Fatou and Julia sets of multivalued analytical functions.
Gumenyuk, P.A. (2002)
Sibirskij Matematicheskij Zhurnal
Similarity:
N-Dimensional Binary Vector Spaces
Kenichi Arai, Hiroyuki Okazaki (2013)
Formalized Mathematics
Similarity:
The binary set {0, 1} together with modulo-2 addition and multiplication is called a binary field, which is denoted by F2. The binary field F2 is defined in [1]. A vector space over F2 is called a binary vector space. The set of all binary vectors of length n forms an n-dimensional vector space Vn over F2. Binary fields and n-dimensional binary vector spaces play an important role in practical computer science, for example, coding theory [15] and cryptology. In cryptology, binary fields...
Complexity of the decidability of the unquantified set theory with a rank operator.
Tetruashvili, M. (1994)
Georgian Mathematical Journal
Similarity:
Basis for identities of the algebra of simplified insertion.
Sverchkov, S.R. (2009)
Sibirskij Matematicheskij Zhurnal
Similarity:
Noncommutative analogs of symmetric polynomials
Maciej Burnecki (1993)
Colloquium Mathematicae
Similarity: