Multisorted Boolean clones determined by binary relations up to minion homomorphisms
From MaRDI portal
Publication:6640574
DOI10.1007/s00012-024-00878-0MaRDI QIDQ6640574
Publication date: 20 November 2024
Published in: Algebra Universalis (Search for Journal in Brave)
Applications of universal algebra in computer science (08A70) Equational logic, Mal'tsev conditions (08B05) Many-valued logic (03B50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weakly terminal objects in quasicategories of \(\mathcal{SET}\) endofunctors
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Galois theory for minors of finite functions
- The wonderland of reflections
- Reflections on and of minor-closed classes of multisorted operations
- On bases of closed classes of Boolean vector functions
- Two-element structures modulo primitive positive constructability
- On some properties of vector functions of Boolean algebra
- Closed systems of functions and predicates
- The lattice of interpretability types of varieties
- On Malcev conditions
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
- Algebraic Approach to Promise Constraint Satisfaction
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- The lattice of clones of self-dual operations collapsed
- On bases of all closed classes of Boolean vector functions
- Submaximal clones over a three-element set up to minor-equivalence
This page was built for publication: Multisorted Boolean clones determined by binary relations up to minion homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640574)