AbstractA general completeness criterion for the finite product ∏P(ki) of full partial clones P(ki) (composition-closed subsets of partial operations) defined on finite sets E(ki)(|E(ki)|⩾2,i=1,…,n,n⩾2) is considered and a Galois connection between the lattice of subclones of ∏P(ki), called partial n-clones, and the lattice of subalgebras of multiple-base invariant relation algebra, with operations of a restricted quantifier free calculus, is established. This is used to obtain the full description of all maximal partial n-clones via multiple-base invariant relations and, thus, to solve the general completeness problem in ∏P(ki)
Kleene Algebra (KA) is the algebra of regular expressions. Central to the study of KA is Kozen’s (19...
The problem of composition of functions is studied for a number of reasons. Finding a constant funct...
AbstractParallel processes confront us with both, strict and non-strict situations. As long as no co...
AbstractA general completeness criterion for the finite product ∏P(ki) of full partial clones P(ki) ...
AbstractCompleteness or primality for partial algebras on a finite universe A is defined in a way si...
AbstractWe investigate interpolation and extrapolation properties of composition-closed sets of part...
A clone on a set A is a collection of (finitary) operations on A that contains the projection operat...
International audiencePartial clone theory has successfully been applied to study the complexity of ...
peer reviewedA Galois connection between partial clones and a new variant of relation algebras is es...
peer reviewedWe show that different coherent relations specify different maximal partial clones. The...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
International audienceA strong partial clone is a set of partial operations closed under composition...
AbstractWe exhibit a finite family of functions over a finite set (i.e. a finite algebra), such that...
I prove a characterization theorem for algebraic bounded complete cpos similar to that for algebraic...
Operation algebras serve as representations of composition algebras (in the sense of Lausch/Nöbauer...
Kleene Algebra (KA) is the algebra of regular expressions. Central to the study of KA is Kozen’s (19...
The problem of composition of functions is studied for a number of reasons. Finding a constant funct...
AbstractParallel processes confront us with both, strict and non-strict situations. As long as no co...
AbstractA general completeness criterion for the finite product ∏P(ki) of full partial clones P(ki) ...
AbstractCompleteness or primality for partial algebras on a finite universe A is defined in a way si...
AbstractWe investigate interpolation and extrapolation properties of composition-closed sets of part...
A clone on a set A is a collection of (finitary) operations on A that contains the projection operat...
International audiencePartial clone theory has successfully been applied to study the complexity of ...
peer reviewedA Galois connection between partial clones and a new variant of relation algebras is es...
peer reviewedWe show that different coherent relations specify different maximal partial clones. The...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
International audienceA strong partial clone is a set of partial operations closed under composition...
AbstractWe exhibit a finite family of functions over a finite set (i.e. a finite algebra), such that...
I prove a characterization theorem for algebraic bounded complete cpos similar to that for algebraic...
Operation algebras serve as representations of composition algebras (in the sense of Lausch/Nöbauer...
Kleene Algebra (KA) is the algebra of regular expressions. Central to the study of KA is Kozen’s (19...
The problem of composition of functions is studied for a number of reasons. Finding a constant funct...
AbstractParallel processes confront us with both, strict and non-strict situations. As long as no co...