Английская Википедия: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 <math>\aleph_1</math>-dense if every two points are separated by exactly <math>\aleph_1</math> other points, where <math>\aleph_1</math> is the smallest uncountable cardinality. This would be true for the real line itself under the continuum hypothesis. An axiom introduced by Шаблон:Harvtxt states that all <math>\aleph_1</math>-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,[1] but not implied by those hypotheses.[2]

Another axiom introduced by Шаблон:Harvtxt states that Martin's axiom for partially ordered sets MAP(κ) is true for all partially ordered sets P that are countable closed, well met and ℵ1-linked and all cardinals κ less than 21.

Baumgartner's axiom A is an axiom for partially ordered sets introduced in Шаблон:Harv. 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

  1. 0 is the same as ≤
  2. If p ≤n+1q then p ≤nq
  3. If there is a sequence pn with pn+1 ≤n pn then there is a q with q ≤n pn for all n.
  4. 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

Шаблон:Reflist

Шаблон:Set index article