Sheffer operation in relational systems

The concept of a Sheffer operation known for Boolean algebras and orthomodular lattices is extended to arbitrary directed relational systems with involution. It is proved that to every such relational system, there can be assigned a Sheffer groupoid and also, conversely, every Sheffer groupoid induces a directed relational system with involution. Hence, investigations of these relational systems can be transformed to the treatment of special groupoids which form a variety of algebras. If the Sheffer operation is also commutative, then the induced binary relation is antisymmetric. Moreover, commutative Sheffer groupoids form a congruence distributive variety. We characterize symmetry, antisymmetry and transitivity of binary relations by identities and quasi-identities satisfied by an assigned Sheffer operation. The concepts of twist products of relational systems and of Kleene relational systems are introduced. We prove that every directed relational system can be embedded into a directed relational system with involution via the twist product construction. If the relation in question is even transitive, then the directed relational system can be embedded into a Kleene relational system. Any Sheffer operation assigned to a directed relational system $${\mathbf {A}}$$ A with involution induces a Sheffer operation assigned to the twist product of $${\mathbf {A}}$$ A .

Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms

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.

CONGRUENCE FD-MAXIMAL VARIETIES OF ALGEBRAS

We study the class of finite lattices that are isomorphic to the congruence lattices of algebras from a given finitely generated congruence-distributive variety. If this class is as large as allowed by an obvious necessary condition, the variety is called congruence FD-maximal. The main results of this paper characterize some special congruence FD-maximal varieties.

The existence of a near-unanimity term in a finite algebra is decidable

We 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.

A Subalgebra Intersection Property for Congruence Distributive Varieties

We prove that if a finite algebra Agenerates a congruence distributive variety, then the subalgebras of the powers of Asatisfy a certain kind of intersection property that fails for finite idempotent algebras that locally exhibit affine or unary behaviour. We demonstrate a connection between this property and the constraint satisfaction problem.

Iterative separation in distributive congruence lattices

In [PLOŠČICA, M.: Separation in distributive congruence lattices, Algebra Universalis 49 (2003), 1–12] we defined separable sets in algebraic lattices and showed a close connection between the types of non-separable sets in congruence lattices of algebras in a finitely generated congruence distributive variety and the structure of subdirectly irreducible algebras in . Now we generalize these results using the concept of separable mappings (defined on some trees) and apply them to some lattice varieties.

PRINCIPAL AND SYNTACTIC CONGRUENCES IN CONGRUENCE-DISTRIBUTIVE AND CONGRUENCE-PERMUTABLE VARIETIES

We give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or, equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very finite.

SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR

We construct a finitely based congruence-distributive variety of algebras in a finite language whose set of subalgebras of finite simple algebras is non-recursive.

Locally finite affine complete varieties

The 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.

The syntax and semantics of entailment in duality theory

Both syntactic and semantic solutions are given for the entailment problem of duality theory. The test algebra theorem provides both a syntactic solution to the entailment problem in terms of primitive positive formula and a new derivation of the corresponding result in clone theory, viz. the syntactic description of Inv(Pol(R)) for a given set R of unitary relations on a finite set. The semantic solution to the entailment problem follows from the syntactic one, or can be given in the form of an algorithm. It shows, in the special case of a purely relational type, that duality-theoretic entailment is describable in terms of five constructs, namely trivial relations, intersection, repetition removal, product, and retractive projection. All except the last are concrete, in the sense that they are described by a quantifier-free formula. It is proved that if the finite algebra M generates a congruence-distributive variety and all subalgebras of M are subdirectly irreducible, then concrete constructs suffice to describe entailment. The concept of entailment appropriate to strong dualities is also introduced, and described in terms of coordinate projections, restriction of domains, and composition of partial functions.