Math 2.0

General algebraic systems Mal'cev conditions Concept

Siggers term

Summary

A Siggers term is an idempotent term of arity 66 that satisfies one fixed identity in three variables, s(x,y,x,z,y,z)≈s(y,x,z,x,z,y)s(x, y, x, z, y, z) \approx s(y, x, z, x, z, y). Every Siggers term is a Taylor term. Conversely, a finite algebra that has a Taylor term also has a Siggers term, so one explicit identity replaces the whole family of Taylor conditions. This makes the Siggers term a convenient test in the algebraic theory of constraint satisfaction problems.

Further reading

  1. Web https://en.wikipedia.org/wiki/Constraint_satisfaction_problem
About this page
TagJYW1H3J8SX
URIm2://JYW1H3J8SX
Kindconcept
WritingW0 stub
MSC08B05, 08A70
SpecializesTaylor term
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions