AbstractKuznecov introduced the concept of primitive positive clones and proved in 1977 that there are 25 Boolean primitive positive clones in a notoriously unavailable article. This paper presents a new proof of his result, relating it to Post's lattice and exhibiting finite bases for those clones
We introduce and investigate the concept of frozen par-tial co-clones. Our main motivation for study...
peer reviewedWe show that different coherent relations specify different maximal partial clones. The...
International audienceWe introduce and investigate the concept of frozen partial co-clones. Our main...
ABSTRACT. Given a finite set A there are only finitely many sequences of the form (Con(An))n>1 or...
There has been a conjectured criterion, by Manuel Bodirsky and myself, for when deciding the truth o...
Two well-studied closure operators for relations are based on existentially quantified conjunctive f...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
Abstract. We summarize what we know about the clone lattice on an infinite set and formulate what we...
The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dich...
A study due to Emil Post shows that, although the lattice of clones in two-valued algebraic logic is...
An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the n...
AbstractIdziak (Int. J. Algebra Comput. 9 (1999) 213) has shown that there are only 14 Mal'tsev poly...
International audienceD. Lau raised the problem of determining the cardinality of the set of all par...
We study centralizer clones of finite lattices and semilattices. For semilattices, we give two chara...
AbstractWe characterize Post classes of Boolean functions (also known as clones) in terms of forbidd...
We introduce and investigate the concept of frozen par-tial co-clones. Our main motivation for study...
peer reviewedWe show that different coherent relations specify different maximal partial clones. The...
International audienceWe introduce and investigate the concept of frozen partial co-clones. Our main...
ABSTRACT. Given a finite set A there are only finitely many sequences of the form (Con(An))n>1 or...
There has been a conjectured criterion, by Manuel Bodirsky and myself, for when deciding the truth o...
Two well-studied closure operators for relations are based on existentially quantified conjunctive f...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
Abstract. We summarize what we know about the clone lattice on an infinite set and formulate what we...
The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dich...
A study due to Emil Post shows that, although the lattice of clones in two-valued algebraic logic is...
An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the n...
AbstractIdziak (Int. J. Algebra Comput. 9 (1999) 213) has shown that there are only 14 Mal'tsev poly...
International audienceD. Lau raised the problem of determining the cardinality of the set of all par...
We study centralizer clones of finite lattices and semilattices. For semilattices, we give two chara...
AbstractWe characterize Post classes of Boolean functions (also known as clones) in terms of forbidd...
We introduce and investigate the concept of frozen par-tial co-clones. Our main motivation for study...
peer reviewedWe show that different coherent relations specify different maximal partial clones. The...
International audienceWe introduce and investigate the concept of frozen partial co-clones. Our main...
DOI
Add to ORKG