Varieties Obeying Homotopy Laws
From MaRDI portal
Cited in
(47)- Simple equations on real intervals
- Laws obeyed by topological algebras - extending results of Hopf and Adams
- Universal algebras
- The wonderland of reflections
- Taylor term does not imply any nontrivial linear one-equality Maltsev condition
- A discrete homotopy theory for binary reflexive structures
- Separation in topological algebras
- Enveloping ringoids
- A characterization of idempotent strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties
- The poset of all logics. III: Finitely presentable logics
- A quasi-Mal'cev condition with unexpected application.
- Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
- The constraint satisfaction problem and universal algebra
- scientific article; zbMATH DE number 4076053 (Why is no real title available?)
- The Relationship Between Two Commutators
- Possible classification of finite-dimensional compact Hausdorff topological algebras
- Towards lambda calculus order-incompleteness
- A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
- Mal'tsev conditions, lack of absorption, and solvability.
- The shape of congruence lattices
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Absorption in universal algebra and CSP
- The complexity of valued CSPs
- THE POSET OF ALL LOGICS I: INTERPRETATIONS AND LATTICE STRUCTURE
- A note on the weakest Taylor term
- Universal algebraic methods for constraint satisfaction problems
- Maltsev families of varieties closed under join or Maltsev product
- Supernilpotent Taylor algebras are nilpotent
- Pseudo‐loop conditions
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
- Learnability of solutions to conjunctive queries
- SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
- On solvability of systems of polynomial equations
- TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
- Idempotent n-permutable varieties.
- Deciding the existence of quasiweak near unanimity terms in finite algebras
- THE POSET OF ALL LOGICS II: LEIBNIZ CLASSES AND HIERARCHY
- Universal algebraic methods for non-classical logics
- Relative Maltsev definability of some commutator properties
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- Relative lengths of Maltsev conditions
- Varieties defined by basic equations have the amalgamation property
- Taylor is prime
- Commutator equations
- What is the weakest idempotent Maltsev condition that implies that abelian tolerances generate abelian congruences?
- Ivo G. Rosenberg's work on maximal clones and minimal clones
- The complexity of adaptably k-colouring edge-coloured hypergraphs
This page was built for publication: Varieties Obeying Homotopy Laws
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4129503)