Pages that link to "Item:Q2536623"
From MaRDI portal
The following pages link to Closed systems of functions and predicates (Q2536623):
Displayed 15 items.
- 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)
- 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)
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) (Q1878398) (← links)
- The completeness problem in partial hyperclones (Q2497478) (← links)
- Finitely Many Primitive Positive Clones (Q3803180) (← links)
- Extension of not everywhere defined functions of many-valued logic (Q4732444) (← links)
- Natural duality via a finite set of relations (Q4848329) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Basics of Galois Connections (Q5504699) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
- Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705) (← links)