Baumgartner's axiom A is an axiom for partially ordered sets introduced in (Baumgartner 1983, section 7). 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
≤0 is the same as ≤
If p ≤n+1q then p ≤nq
If there is a sequence pn with pn+1 ≤npn then there is a q with q ≤npn 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 ≤np and the number of elements of I compatible with q is countable.
References
^Baumgartner, James E. (1973), "All -dense sets of reals can be isomorphic", Fundamenta Mathematicae, 79 (2): 101–106, doi:10.4064/fm-79-2-101-106, MR0317934
Baumgartner, James E. (1975), Generalizing Martin's axiom, unpublished manuscript
Baumgartner, James E. (1983), "Iterated forcing", in Mathias, A. R. D. (ed.), Surveys in set theory, London Math. Soc. Lecture Note Ser., vol. 87, Cambridge: Cambridge Univ. Press, pp. 1–59, ISBN0-521-27733-7, MR0823775
This set index article includes a list of related items that share the same name (or similar names). If an internal link incorrectly led you here, you may wish to change the link to point directly to the intended article.