Pages that link to "Item:Q2536623"
From MaRDI portal
The following pages link to Closed systems of functions and predicates (Q2536623):
Displayed 50 items.
- A short introduction to clones. (Q280194) (← links)
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages (Q280200) (← links)
- Semantical conditions for the definability of functions and relations (Q312209) (← links)
- Galois theory for semiclones (Q334979) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- Meet-irreducible submaximal clones determined by nontrivial equivalence relations (Q382339) (← links)
- Galois theory for sets of operations closed under permutation, cylindrification, and composition (Q422339) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- Boolean max-co-clones (Q494629) (← links)
- Rigid binary relations on a 4-element domain (Q523155) (← links)
- Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
- Clones with finitely many relative \({\mathcal R}\)-classes (Q535115) (← links)
- Closed classes of functions, generalized constraints, and clusters (Q607451) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- The complexity of equality constraint languages (Q929295) (← links)
- On Boolean primitive positive clones (Q932583) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Algebras of prime cardinality with a cyclic automorphism (Q1165263) (← links)
- The subalgebra systems of direct powers (Q1247355) (← links)
- On the algebraic structure of combinatorial problems (Q1276253) (← links)
- Galois connection for multiple-output operations (Q1652848) (← links)
- Unique inclusions of maximal C-clones in maximal clones (Q1652863) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- On orders of closed classes containing a homogeneous switching function (Q1759160) (← links)
- Taylor's modularity conjecture and related problems for idempotent varieties (Q1789053) (← links)
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) (Q1878398) (← links)
- A general Galois theory for operations and relations in arbitrary categories (Q1935011) (← links)
- Lewis dichotomies in many-valued logics (Q1935553) (← links)
- Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
- On finitely related semigroups. (Q1955601) (← links)
- Critical relations of crowns in critical times of coronavirus depression (Q2160020) (← links)
- Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
- Existence of cube terms in finite algebras (Q2226982) (← links)
- Solution sets of systems of equations over finite lattices and semilattices (Q2297806) (← links)
- The size of generating sets of powers (Q2318479) (← links)
- Finite degree clones are undecidable (Q2333801) (← links)
- Existence of finite total equivalence systems for certain closed classes of 3-valued logic functions (Q2342799) (← links)
- Functional clones and expressibility of partition functions (Q2357376) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Deciding absorption in relational structures (Q2407970) (← links)
- Weak bases of Boolean co-clones (Q2448853) (← links)
- The existence of a near-unanimity function is decidable (Q2449447) (← links)
- The completeness problem in partial hyperclones (Q2497478) (← links)
- Dualizable algebras with parallelogram terms (Q2520769) (← links)
- CSP for binary conservative relational structures (Q2634708) (← links)