We investigate classes of tree functions which are closed under composition and primitive recursion or selection (a restricted form of recursion). The main result is the characterization of those finitary relations ς (on the set of all trees of a fixed signature) for which the clone of tree functions preserving ς is closed under selection. Moreover, it turns out that such clones are closed also under primitive recursion
AbstractFor each clone C on a set A there is an associated equivalence relation, called C-equivalenc...
All minimal clones containing a three-element grupoid have been determined in [3]. In this paper we ...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
A clone on a set A is a collection of (finitary) operations on A that contains the projection operat...
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...
AbstractThis article discusses clones with nullary operations and the corresponding relational clone...
A clone is a set of finitary operations closed under composition and contain- ing all projections. W...
A restricted version of the Galois connection between polymorphisms and invariants, called Pol−CInv,...
peer reviewedFor each clone C on a set A there is an associated equivalence relation analogous to Gr...
For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relat...
Given a clone C on a set A, we characterize the clone of operations on A which are local term operat...
We introduce a special set of relations on a finite set, called clausal relations. A restricted vers...
AbstractIn universal algebra, clones are used to study algebras abstracted from their signature. The...
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions {0,1}...
AbstractFor each clone C on a set A there is an associated equivalence relation, called C-equivalenc...
All minimal clones containing a three-element grupoid have been determined in [3]. In this paper we ...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
A clone on a set A is a collection of (finitary) operations on A that contains the projection operat...
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...
AbstractThis article discusses clones with nullary operations and the corresponding relational clone...
A clone is a set of finitary operations closed under composition and contain- ing all projections. W...
A restricted version of the Galois connection between polymorphisms and invariants, called Pol−CInv,...
peer reviewedFor each clone C on a set A there is an associated equivalence relation analogous to Gr...
For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relat...
Given a clone C on a set A, we characterize the clone of operations on A which are local term operat...
We introduce a special set of relations on a finite set, called clausal relations. A restricted vers...
AbstractIn universal algebra, clones are used to study algebras abstracted from their signature. The...
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions {0,1}...
AbstractFor each clone C on a set A there is an associated equivalence relation, called C-equivalenc...
All minimal clones containing a three-element grupoid have been determined in [3]. In this paper we ...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...