Baumgartner's Axiom

In mathematical set theory, Baumgartner's axiom (BA) can be one of three different axioms introduced by James Earl Baumgartner.

A subset of the real line is said to be $\aleph_1$- dense if every two points are separated by exactly $\aleph_1$ other points, where $\aleph_1$ is the smallest uncountable cardinality. This would be true for the real line itself under the continuum hypothesis. An axiom introduced by states that all $\aleph_1$- dense subsets of the real line are order-isomorphic, providing a higher-cardinality analogue of Cantor's isomorphism theorem that countable dense subsets are isomorphic. Baumgartner's axiom is a consequence of the proper forcing axiom. It is consistent with a combination of ZFC, Martin's axiom, and the negation of the continuum hypothesis, but not implied by those hypotheses.

Another axiom introduced by states that Martin's axiom for partially ordered sets MA_''P''(''κ'') is true for all partially ordered sets ''P'' that are countable closed, well met and ℵ₁-linked and all cardinals κ less than 2^ℵ₁.

Baumgartner's axiom A is an axiom for partially ordered sets introduced in . A partial order (''P'', ≤) is said to satisfy axiom A if there is a family ≤_''n'' of partial orderings on ''P'' for ''n'' = 0, 1, 2, ... such that
# ≤₀ is the same as ≤
#If ''p'' ≤_''n''+1''q'' then ''p'' ≤_''n''''q''
#If there is a sequence ''p''_''n'' with ''p''_''n''+1 ≤_''n'' ''p''_''n'' then there is a ''q'' with ''q'' ≤_''n'' ''p''_''n'' for all ''n''.
#If ''I'' is a pairwise incompatible subset of ''P'' then for all ''p'' and for all natural numbers ''n'' there is a ''q'' such that ''q'' ≤_''n'' ''p'' and the number of elements of ''I'' compatible with ''q'' is countable.

References

*
*
*

{{Set index article, mathematics

Axioms of set theory