In mathematics, a Suslin algebra is a
Boolean algebra
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variable (mathematics), variables are the truth values ''true'' and ''false'', usually denot ...
that is
complete,
atomless, countably
distributive, and satisfies the
countable chain condition In order theory, a partially ordered set ''X'' is said to satisfy the countable chain condition, or to be ccc, if every strong antichain in ''X'' is countable.
Overview
There are really two conditions: the ''upwards'' and ''downwards'' countable c ...
. They are named after
Mikhail Yakovlevich Suslin.
The existence of Suslin algebras is independent of the axioms of
ZFC, and is equivalent to the existence of
Suslin trees or
Suslin lines.
See also
*
Andrei Suslin
Andrei Suslin (, sometimes transliterated Souslin) was a Russian mathematician who contributed to algebraic K-theory and its connections with algebraic geometry. He was a Trustee Chair and Professor of mathematics at Northwestern University.
He ...
References
Boolean algebra
Forcing (mathematics)
Independence results
{{algebra-stub