Closed systems of functions and predicates

Cited In (only showing first 100 items - show all)

Extension of not everywhere defined functions of many-valued logic
Natural duality via a finite set of relations
On finitely related semigroups.
Clones with finitely many relative \({\mathcal R}\)-classes
On the expression complexity of equivalence and isomorphism of primitive positive formulas
Trichotomies in the complexity of minimal inference
Weak bases of Boolean co-clones
A GENERAL DUALITY THEORY FOR CLONES
The lattice of alter egos
Colouring, constraint satisfaction, and complexity
The complexity of satisfiability problems: Refining Schaefer's theorem
Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
A short introduction to clones.
Logical relations and parametricity -- a Reynolds programme for category theory and programming languages
Title not available (Why is that?)
The complexity of equality constraint languages
Complexity Classifications for Logic-Based Argumentation
Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
COUNTING THE RELATIONS COMPATIBLE WITH AN ALGEBRA
On orders of closed classes containing a homogeneous switching function
On the algebraic structure of combinatorial problems
A complete classification of equational classes of threshold functions included in clones
Structure identification of Boolean relations and plain bases for co-clones
On Boolean primitive positive clones
Title not available (Why is that?)
Semantical conditions for the definability of functions and relations
Galois theory for semiclones
Galois connection for multiple-output operations
What makes propositional abduction tractable
A general Galois theory for operations and relations in arbitrary categories
Unique inclusions of maximal C-clones in maximal clones
A combinatorial constraint satisfaction problem dichotomy classification conjecture
Galois theory for sets of operations closed under permutation, cylindrification, and composition
Lewis dichotomies in many-valued logics
Topological Birkhoff
Generic expression hardness results for primitive positive formula comparison
Closed classes of functions, generalized constraints, and clusters
Strong partial clones and the time complexity of SAT problems
The subalgebra systems of direct powers
Clones of algebras with parallelogram terms
CSP for binary conservative relational structures
An algebraic hardness criterion for surjective constraint satisfaction.
Basics of Galois Connections
Solution sets of systems of equations over finite lattices and semilattices
Existence of cube terms in finite algebras
Taylor's modularity conjecture and related problems for idempotent varieties
The constraint satisfaction problem and universal algebra
Title not available (Why is that?)
Boolean max-co-clones
On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Affine systems of equations and counting infinitary logic
Functional clones and expressibility of partition functions
The size of generating sets of powers
Meet-irreducible submaximal clones determined by nontrivial equivalence relations
The completeness problem in partial hyperclones
Robustly solvable constraint satisfaction problems
Algebras of prime cardinality with a cyclic automorphism
Constraint Satisfaction Problems with Infinite Templates
Title not available (Why is that?)
The existence of a near-unanimity function is decidable
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
Finitely Many Primitive Positive Clones
A Generalized Version of the Baker–Pixley Theorem
Partial Polymorphisms and Constraint Satisfaction Problems
Rigid binary relations on a 4-element domain
Gap theorems for robust satisfiability: Boolean CSPs and beyond
An algebraic characterization of tractable constraints
CHARACTERIZATION OF PRECLONES BY MATRIX COLLECTIONS
A Dichotomy Theorem for the Inverse Satisfiability Problem
Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
Title not available (Why is that?)
Finite degree clones are undecidable
Galois theory for analogical classifiers
The lattice and semigroup structure of multipermutations
Generalized satisfiability problems via operator assignments
Existence of finite total equivalence systems for certain closed classes of 3-valued logic functions
All centralising monoids with majority witnesses on a four-element set
Title not available (Why is that?)
Quantified Constraints in Twenty Seventeen
On the use of majority for investigating primeness of 3-permutability
n-Permutability is not join-prime for n ≥ 5
Title not available (Why is that?)
Title not available (Why is that?)
Topology and Adjunction in Promise Constraint Satisfaction
Title not available (Why is that?)
Critical relations of crowns in critical times of coronavirus depression
Submaximal clones over a three-element set up to minor-equivalence
Exploring new topologies for the theory of clones
Multisorted Boolean clones determined by binary relations up to minion homomorphisms
Polymorphism-homogeneity and universal algebraic geometry
Time Complexity of Constraint Satisfaction via Universal Algebra
Title not available (Why is that?)
Deciding absorption in relational structures
Forbidden tournaments and the orientation completion problem
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
The lattice of clones of self-dual operations collapsed
The algebraic structure of the densification and the sparsification tasks for CSPs
Constraint satisfaction problem: what makes the problem easy

This page was built for publication: Closed systems of functions and predicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2536623)