Hostname: page-component-77c89778f8-9q27g Total loading time: 0 Render date: 2024-07-22T19:35:03.446Z Has data issue: false hasContentIssue false

Combinatorics on ideals and axiom A

Published online by Cambridge University Press:  12 March 2014

James D. Sharp*
Affiliation:
Department of Mathematics, Rutgers University, New Brunswick. New Jersey 08903, E-mail: jsharp@math.rutgers.edu

Extract

Throughout this paper denotes a nonprincipal ultrafilter and denotes the dual ideal. ℙ() is the poset of all partial functions p: ω → 2 such that dom(p) ∈ . In [2], Grigorieff proved that ω1 is preserved in the corresponding generic extension if and only if is a P-point. Later, when Shelah introduced the notion of a proper poset, many people observed that if is a P-point, then ℙ() is proper. One way of proving this is to show that player II has a winning strategy in the game for ℙ() (see [3, p. 91].)

The notion of an Axiom A poset was introduced by Baumgartner [1]. If a poset satisfies Axiom A, then player II has a winning strategy in the game for ℙ, and thus, ℙ is proper. Indeed most of the naturally occurring proper posets satisfy Axiom A (e.g., Mathias's poset and Laver's poset). Thus, it is natural to ask whether or not ℙ() satisfies Axiom A. The main result of this paper is a negative answer to this question. We will prove this by introducing another game and showing that is a P-point if and only if the corresponding game is undetermined. We will then show that if ℙ() satisfied Axiom A, then player II would have a winning strategy in the corresponding game .

We let [X]<ω = {sX∣ ∣s∣ < ω}. We let Seq(X) denote the set of finite sequences of elements of X. If s = 〈x0, …, xn〉 ∈ Seq(X) and yX, then s * 〈y〉 = 〈x0,…,xn,y〉 ∈ Seq(X).

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Baumgartner, J., Iterated forcing, Surveys in set theory, (Mathias, A. R. D., editor), Cambridge University Press, London and New York, 1983, pp. 1–59.Google Scholar
[2]Grigorieff, S., Combinatorics on ideals and forcing, Annals of Mathematical Logic, vol. 3 (1971), pp. 363–394.CrossRefGoogle Scholar
[3]Jeck, T., Multiple forcing, Cambridge University Press, London and New York, 1986.Google Scholar
[4]Shelah, S., Proper forcing, Springer-Verlag, Berlin and New York, 1982.CrossRefGoogle Scholar