near unanimity term
Recently Published Documents


TOTAL DOCUMENTS

9
(FIVE YEARS 0)

H-INDEX

5
(FIVE YEARS 0)

Author(s):  
PAOLO LIPPARINI

Abstract For every n, we evaluate the smallest k such that the congruence inclusion $\alpha (\beta \circ _n \gamma ) \subseteq \alpha \beta \circ _{k} \alpha \gamma $ holds in a variety of reducts of lattices introduced by K. Baker. We also study varieties with a near-unanimity term and discuss identities dealing with reflexive and admissible relations.


2018 ◽  
Vol 83 (1) ◽  
pp. 40-54 ◽  
Author(s):  
MIGUEL CAMPERCHOLI

AbstractLetA≤Bbe structures, and${\cal K}$a class of structures. An elementb∈BisdominatedbyArelative to${\cal K}$if for all${\bf{C}} \in {\cal K}$and all homomorphismsg,g':B → Csuch thatgandg'agree onA, we havegb=g'b. Our main theorem states that if${\cal K}$is closed under ultraproducts, thenAdominatesbrelative to${\cal K}$if and only if there is a partial functionFdefinable by a primitive positive formula in${\cal K}$such thatFB(a1,…,an) =bfor somea1,…,an∈A. Applying this result we show that a quasivariety of algebras${\cal Q}$with ann-ary near-unanimity term has surjective epimorphisms if and only if$\mathbb{S}\mathbb{P}_n \mathbb{P}_u \left( {\mathcal{Q}_{{\text{RSI}}} } \right)$has surjective epimorphisms. It follows that if${\cal F}$is a finite set of finite algebras with a common near-unanimity term, then it is decidable whether the (quasi)variety generated by${\cal F}$has surjective epimorphisms.


2016 ◽  
Vol 76 (1) ◽  
pp. 111-126
Author(s):  
Ratana Srithus ◽  
Udom Chotwattakawanit

2013 ◽  
Vol 65 (1) ◽  
pp. 3-21 ◽  
Author(s):  
Libor Barto

Abstractwe show that every finite, finitely related algebra in a congruence distributive variety has a near unanimity term operation. as a consequence we solve the near unanimity problem for relational structures: it is decidable whether a given finite set of relations on a finite set admits a compatible near unanimity operation. this consequence also implies that it is decidable whether a given finite constraint language defines a constraint satisfaction problem of bounded strict width.


2012 ◽  
Vol 22 (01) ◽  
pp. 1250005 ◽  
Author(s):  
KEITH A. KEARNES ◽  
ÁGNES SZENDREI

We describe a manageable set of relations that generates the finitary relational clone of an algebra with a parallelogram term. This result applies to any algebra with a Maltsev term and to any algebra with a near unanimity term. One consequence of the main result is that on any finite set and for any finite k there are only finitely many clones of algebras with a k-ary parallelogram term which generate residually small varieties.


2009 ◽  
Vol 74 (3) ◽  
pp. 1001-1014 ◽  
Author(s):  
Miklós Maróti

AbstractWe prove that it is decidable of a finite algebra whether it has a near-unanimity term operation, which settles a ten-year-old problem. As a consequence, it is decidable of a finite algebra in a congruence distributive variety whether it admits a natural duality.


2007 ◽  
Vol 57 (2) ◽  
pp. 215-237 ◽  
Author(s):  
Miklós Maróti

Author(s):  
Kalle Kaarli

AbstractThe main results of the paper are the following: 1. Every locally finite affine complete variety admits a near unanimity term; 2. A locally finite congruence distributive variety is affine complete if and only if all its algebras with no proper subalgebras are affine complete and the variety is generated by one of such algebras. The first of these results sharpens a result of McKenzie asserting that all locally finite affine complete varieties are congruence distributive. The second one generalizes the result by Kaarli and Pixley that characterizes arithmetical affine complete varieties.


1995 ◽  
Vol 51 (3) ◽  
pp. 469-478 ◽  
Author(s):  
László Zádori

We present a duality theorem. We give a necessary and sufficient condition for any set of algebraic relations to entail the set of all algebraic relations in Davey and Werner's sense. The main result of the paper states that for a finite algebra a finite set of algebraic relations yields a duality if and only if the set of all algebraic relations can be obtained from it by using four types of relational constructs. Finally, we prove that a finite algebra admits a natural duality if and only if the algebra has a near unanimity term operation, provided that the algebra possesses certain 2k-ary term operations for some k. This is a generalisation of a theorem of Davey, Heindorf and McKenzie.


Sign in / Sign up

Export Citation Format

Share Document