A restricted version of the Galois connection between polymorphisms and invariants, called Pol−CInv, is studied, where the invariant relations are restricted to so-called clausal relations. In this context, the relationship of maximal C-clones and maximal clones is investigated. It is shown that, with the exception of one special case occurring for Boolean domains, maximal C-clones are never maximal clones.:1 Introduction 2 Preliminaries 3 Proof of the main theorem 3.1 Principle of proof 3.2 Bounded orders 3.3 Non-trivial congruences 3.4 Selfdual functions 3.5 Quasilinear functions 3.6 Functions preserving central and h-regular relations 4 Concluding remarks ReferencesWir untersuchen eine eingeschränkte Variante der Galoisverbindung zwische...
We consider finitary relations (also known as crosses) that are definable via finite disjunctions of...
It is known that a countable -categorical structure interprets all finite structures primitively pos...
It is known that a countable omega-categorical structure interprets all finite structures primitivel...
A restricted version of the Galois connection between polymorphisms and invariants, called Pol−CInv,...
A restricted version of the Galois connection between polymorphisms and invariants, called Pol−CInv,...
We introduce a special set of relations on a finite set, called clausal relations. A restricted vers...
C-clones are polymorphism sets of so-called clausal relations, a spe-cial type of relations on a fin...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
AbstractThis article discusses clones with nullary operations and the corresponding relational clone...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
peer reviewedA Galois connection between partial clones and a new variant of relation algebras is es...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
peer reviewedWe show that different coherent relations specify different maximal partial clones. The...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
We consider finitary relations (also known as crosses) that are definable via finite disjunctions of...
It is known that a countable -categorical structure interprets all finite structures primitively pos...
It is known that a countable omega-categorical structure interprets all finite structures primitivel...
A restricted version of the Galois connection between polymorphisms and invariants, called Pol−CInv,...
A restricted version of the Galois connection between polymorphisms and invariants, called Pol−CInv,...
We introduce a special set of relations on a finite set, called clausal relations. A restricted vers...
C-clones are polymorphism sets of so-called clausal relations, a spe-cial type of relations on a fin...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
AbstractThis article discusses clones with nullary operations and the corresponding relational clone...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
peer reviewedA Galois connection between partial clones and a new variant of relation algebras is es...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
peer reviewedWe show that different coherent relations specify different maximal partial clones. The...
A Galois connection between clones and relational clones on a fixed finite domain is one of the corn...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
We consider finitary relations (also known as crosses) that are definable via finite disjunctions of...
It is known that a countable -categorical structure interprets all finite structures primitively pos...
It is known that a countable omega-categorical structure interprets all finite structures primitivel...