1. Introduction
In §2 we prove a result in general topology saying: if then any normal space is (=collectionwise Hausdorff); done independently of and in parallel to Fleisner and Alan D. Taylor.
In §3 we prove the Chang Conjecture for Magidor-Malitz Quantifiers. A recent related piece of work is [
1].
In §4 we prove the Monadic Theory of the tree
is complicated under a quite weak set theoretic assumption. Earlier [
2] proved this (i.e., the result on the monadic logic) assuming
or at least a consequence of it.
The present note was circulated in the Spring of 1979 in a collection; it include each of the sections (as well as other preprints) but those three were not published. However, Ref. [
3]. have results related to
Section 3; in particular it was conjectured there (in Remark 2.15) that there are two non-principal ultrafilters of
with no common lower bound in the Rudin Keisler order; a conjecure which had been refuted in [
4].
Later, Gurevich-Shelah [
5] proved undecidability in
, with further developments then more in Shelah [
6], still the older proof gives information not covered by them. For more see [
4,
7,
8].
The results are old, still in particular, §2 gives a direct proof of the result compared to others and §4 gives a considerably more transparent easier proof of the later result of [
5] but with an extra weak hypothesis.
The author would like to thank Shai Ben David for stimulating discussions on part §3.
We thank the referee for his help, well beyond than the call of duty.
2. A Note in General Topology If Then Any Normal Space Is (=Collectionwise HAUSDORFF)
The normal Moore space problem has been a major theme in general topology, see the recent survey Dow-Tall [
9]. In this connection, Fleissner ([
10], p. 6) proved:
every normal first countable (topological) space is
(
means collectionwise Hausdorff). He used a strengthening of diamond. The author proved Fleissner strengthening (for
) does not follow from
(see [
11], Th. 5, p. 31). Here we prove nevertheless
implies every normal first countable space is
.
The central idea of the proof in §2 is inspired by one key idea in Fleissner [
10]. Fleissner implicitly used a stronger combinatorial principle
. In 1979, the author and independently both Fleissner and Alan D. Taylor all saw (as mentioned in [
12,
13] that a weaker principle,
, would suffice. Later Smith and Szeptycki [
12] derive better results. On more recent results on diamond and strong negation, see [
14] and references there.
Definition 1. Below δ always denotes a limit ordinal . For transparency, below we refer to the following equivalent form of .
Definition 2. Let mean that there exist a sequence where is of the form , where has the property that, for any sequence with , there is a club (closed unbounded) set such that, for each , there is with Theorem 1. Assume . If X is Hausdorff first countable normal and then X is CWH.
Proof. Let be as in Definition 2.
Without loss of generality and is closed discrete in the space X. Let be a basis of open neighborhoods of (for ). We shall define by induction on a limit ordinal and such that is increasing continuous with and . For choose . For limit let be . For if then we let and let for . Finally assume that so .
We have chosen above the functions
with
; now for each
let
(for
). Call
good for
when for infinitely many (pairs)
we have
We let and if and and then .
Now we choose
such that for any
k good for
, for some
we have
Then we complete arbitrarily the so that its domain is .
Thus we have defined
with
. For each
n the sets
form a partition of
, both are closed and discrete subsets of
X. But
X is normal. So there are functions
for
so that letting for
we have
Let be any function from to extending . For some closed unbounded set we have: . Let the first such k be denoted . Without loss of generality every satisfy hence if and then .
For now cannot be good for , (by the definition).
Now for at least one n (in fact, for infinitely many n-s) we have for , let be the first such n.
Now almost exhibits has the right sequence of neighborhoods. Now we can deal with each separately (just choose by induction on n such that is open, and , possible by normality).
By dealing as follows with each interval for we have as required.
That is, for with its successor in C, choose a (countable) family of pairwise disjoint open sets for , with , this is possible as in the choice of the ’s.
Now for we let where:
Finally is a sequence of pairwise disjoint open sets of X with , so we are done. □
Remark 1. As in [10] it suffices to assume every point in the space has a neighborhood basis of cardinality . 3. Chang Conjecture for Magidor-Malitz Quantifiers
Silver (see [
15]) had proved the consistency of Chang conjecture, i.e.,
- ⊕
any model M with universe (and countable signature = vocabulary) , has an elementary submodel
Silver did this by starting with a model
with
Ramsey (in fact, something weaker suffices), forcing
and then collapsing
to
by
has cardinality
, and for some
,
is a function from
to
. See also Koszmider [
16] for a topological application.
We can ask whether this submodel N can inherit more properties from M.
Definition 3. Let us define a (technical variant of) Magidor-Malitz quantifiers. means that there is a setis of cardinality such that .
The result is that:
Claim 1. In ⊕ above, we can have N an elementary submodel of M even for the logic. So e.g., Suslinity of trees is preserved.
For this we need the following.
Definition 4. Call a forcing suitable when for any sequence of members of there is a set of cardinality such that: for any finite there is such that .
Claim 2. Forcing by suitable forcing preserves satisfaction of sentences of Magidor-Malitz quantifiers for models of power.
See ([
17], 1.5–13, p. 34).
Claim 3. There is a suitable forcing, such that in: ifis a suitable forcing of powera-name of a model of power, in a language, universe, then there is a directed, which determinesas M and such that for any sentencefrom the(the variant of Magidor-Malitz logic from Definition 3) Proof. Just iterate the required forcing notions, with direct limit (i.e., finite support) and remember it is known that suitability is preserved under iteration, i.e., Claim 2.
Proof of Main result Claim 1:
Do as Silver, start with Ramsey”, force by from Claim 3, and then use . The rest is as in his proof.
But we have to choose G as in Definition 3, and notice that more is reflected to the submodel he uses, (just check the definition carefully) and work a little, and remember that -complete forcing preserves satisfaction of sentences in (and is -complete). □
4. A Remark on the Monadic Theory of Order
In [
2] we prove the undecidability of the monadic theory of (the order)
R, assuming CH, or the weaker Baire-like hypothesis that
is not the union of fewer than continuum sets of first category sets. This condition is weaken below to ‘‘not (
) at least for
T where a closely related theory is the monadic theory
T of
where
is the set of sequences of zeros and ones of length
is the (partial) order of being initial segment.
T is closely related to Rabin’s monadic theory of
which he proved decidable [
18]. We prove here that the statement “
” implies the undecidability of
T (and all results on its complexity, see [
2] and the paper of Gurevich on the subject)
but it was not clear (at that time) whether (St) is consistent with ZFC.
Definition 5. A Cantor [set] C is a non-empty subset of with the properties
- (a)
C is closed under initial segments,
- (b)
ifhas lengththen,
- (c)
impliesor,
- (d)
for every, there is and .
Definition 6. (1) For a Cantor C, the set of its splitting points isand.
(2) For a set is an A-Cantor, if.
(3) For a set is called an S-Cantor, if (4) An odd Cantor is one that is an -Cantor. An even Cantor is one that is an -Cantor.
Now the statement we speak about is
Definition 7. Let mean: the set is the union of less than Cantors each of them odd or even.
Problem 1. Is consistent with ?; solved in [4]. Claim 4. Letbe a family of odd and even Cantors,. Then.
Proof. Let for be defined by , and then let .
Now for any even C, and there is at most one such that ; why? if are such ’s, , then, by the definition of , for some . If then so they are equal, contradiction. If , then ( and) is a splitting point of C, however m is odd and C is an even Cantor, a contradiction. So really there is at most one , and let be the unique if there is one and otherwise.
Similarly if C is odd and , then for at most one and let be for this , and let otherwise. Our definition of the function does not contradict, because no Cantor is odd and even.
Let for . So clearly is a subset of of cardinality .
Now if , by hypothesis belongs to some . If is odd this implies and if is even this implies .
If we can easily find a counterexample. □
Definition 8. Assume.
Ifare infinite pairwise almost disjoint (for),are Cantors, each an-Cantor for some n (or just an-Contor for some n), C is a Cantor for every, there is ν, such that .
Then there is.
(2) Similarly for
Proof. (1) We can find a Cantor , and :
- (∗)
if , then there are exactly two , and if they are and then but . Moreover if n is even.
Let , so . Clearly there is an isomorphism f, of the models .
Let , it is easy to check that each is countable, or the union of a countable set and a Cantor which is odd or is even.
We can find odd Cantor all countable sets we mentioned are covered by them. Now by—“” there is (as ) and is the required elements.
(2) Similarly. □
(Now we have added Claim 5 and Definition 9 in 2019).
Claim 5. Assume . (1) The monadic theory T is undecidable.
Proof. Below let
P vary on Cantors and note that we can repeat the proof of [
2] with small adaptation (and prove
T is undecidable). That is, the change needed is in ([
2], (7.4)) which has a set-theoretic hypothesis (CH or the Baire-like hypothesis mentioned above), so we repeat it with the needed changes below. □
Definition 9. Assumeand let J be an index-set of cardinality at most, (1) Assume thecountable dense subsets ofandand(The main case is that the-s are pairwise almost disjoint). Then there issuch that for every Cantor P:
- (A)
ifandis dense in P then
- (B)
if for somethe setsare dense in P then.
(2) For some suchwe can strengthen clause (B) above to
- (B)
if P is a Cantor and for everythe setis nowhere-dense in P then for every, dense subsetsofwe can findsatisfying for any P we have: isare dense in P then.
Proof. (1) Let be any enumeration of the Cantor sets. We define by induction on .
For is arbitrary.
For any , if does not satisfy the assumptions of (B) then let and if P satisfies the assumptions of (B) (hence in particular D is dense in P) let and D is dense in .
This is possible; to prove this let there is such that and for let be such that Let be such that are dense in P. Now we apply Definition 8(2), (or Definition 8(1) if we restrict the -s, does not matter).
So by and the hypothesis there exists such .
Now let . If P satisfies the assumptions of (A), then . So for some , hence , so . If satisfies the assumption of (B) then , hence .
(2) Similarly.
So we have proved the lemma. □
Definition 10. We can interpret the monadic theory of in T, but the converse was not clear at the time, but looking at it again probably we can carry the proof for .