Let kappa a regular uncountable cardinal and lambda a cardinal >kappa, and suppose lambda^{<kappa} is less than the covering number for category cov(M_{kappa,kappa}). Then (a) I_{kappa,lambda}^+ -->^kappa (I_{kappa, lambda}^+,omega +1)^2,
(b) I_{kappa, lambda}^+ -->^kappa [I_{kappa, lambda}^+]_{kappa^+}^2 if kappa is a limit cardinal, and (c) I_{kappa, lambda}^+ -->^kappa (I_{kappa, lambda}^+)^2 if kappa is weakly compact.
We prove that if lambda is a strong limit singular cardinal and kappa a regular uncountable cardinal < lambda, then NS_{kappa lambda}, the non-stationary ideal over P_{kappa} lambda, is nowhere precipitous. We also show that under the same hypothesis every stationary subset of P_{kappa} lambda can be partitioned into lambda^{< kappa} disjoint stationary sets.
Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa the principle is known to fail at some lambda. This note shows that it fails at every lambda if kappa is the successor of a regular uncountable cardinal or kappa is countably closed.
We give some existence/nonexistence statements on universal graphs, which under GCH give a necessary and sufficient condition for the existence of a universal graph of size lambda with no K(kappa), namely, if either kappa is finite or cf(kappa)>cf(lambda). (Here K(kappa) denotes the complete graph on kappa vertices.) The special case when lambda^{< kappa}= lambda was first proved by F. Galvin. Next, we investigate the question that if there is no universal K(kappa)-free graph of size lambda then how many of these graphs embed all the other. It was known, that if lambda^{< lambda}= lambda (e.g.…
Suppose lambda is a singular cardinal of uncountable cofinality kappa. For a model M of cardinality lambda, let No(M) denote the number of isomorphism types of models N of cardinality lambda which are L_{infty lambda}-equivalent to M. In [Sh:189] inverse kappa-systems A of abelian groups and their certain kind of quotient limits Gr(A)/Fact(A) were considered. It was proved that for every cardinal mu there exists an inverse kappa-system A such that A consists of abelian groups having cardinality at most mu^kappa and card(Gr(A)/Fact(A))= mu. In [Sh:228] a strict connection between inverse kappa-…
Let kappa be a regular uncountable cardinal and lambda > kappa a singular strong limit cardinal. We give a new characterization of the nonstationary subsets of P_kappa (lambda) and use this to prove that the nonstationary ideal on P_kappa (lambda) is nowhere precipitous.
We continue the work of [KlSh:362] and prove that for lambda successor, a lambda-categorical theory T in L_{kappa^*, omega} is mu-categorical for every mu, mu <= lambda which is above the (2^{LS(T)})^+-beth cardinal.
We argue that we solved Hilbert's first problem positively (after reformulating it just to avoid the known consistency results) and give some applications. Let lambda to the revised power of kappa, denoted lambda^{[kappa]}, be the minimal cardinality of a family of subsets of lambda each of cardinality kappa such that any other subset of lambda of cardinality kappa is included in the union of <kappa members of the family. The main theorem says that almost always this revised power is equal to lambda. Our main result is The Revised GCH Theorem: Assume we fix an uncountable strong limit cardinal…
Ordinary infinitary languages L_{lambda, kappa} satisfy the Interpolation Theorem only in the case lambda <= {aleph_1}, kappa = {aleph_0}, this include first order logic of course. There are also some pairs of such logics satifying interpolation, e.g. (L_{lambda^+,{aleph_0}}, L_{(2^lambda)^+, lambda^+}) . Does this come from an intermidiate logic satisfying it? Is it nice? unique? We define for kappa = beth_kappa a new logic L^1_kappa such that L_{kappa omega}< L^1_kappa LL_{kappa kappa} and L^1_kappa is very nice; in particular satisfies the Interpolation Theorem. Moreover, L^1_kappa has a mo…
We reconsider here the following related pcf questions and make some advances: (Q1) concerning the ideal {check I}_kappa [lambda] how much reflection do we have for the bad set S^{bd}_{lambda, kappa} subseteq {delta < lambda : cf(delta)= kappa} assuming it is well defined? (Q2) for an ideal J on kappa how large are S^{bd}_J[f],S^{ch}_J[f] for f=< f_alpha : alpha<lambda > which is <_J-increasing and cofinal in (prod limits_{i< kappa} lambda_i,<_J) ? (Q3) are there somewhat free black boxes?
It is shown that if T is stable unsuperstable, and aleph_1< lambda =cf(lambda)< 2^{aleph_0}, or 2^{aleph_0} < mu^+< lambda =cf(lambda)< mu^{aleph_0} then T has no universal model in cardinality lambda, and if e.g. aleph_omega < 2^{aleph_0} then T has no universal model in aleph_omega. These results are generalized to kappa =cf(kappa) < kappa (T) in the place of aleph_0. Also: if there is a universal model in lambda >|T|, T stable and kappa < kappa (T) then there is a universal tree of height kappa +1 in cardinality lambda .
We show that supercompactness and strong compactness can be equivalent even as properties of pairs of regular cardinals. Specifically, we show that if V models ZFC + GCH is a given model (which in interesting cases contains instances of supercompactness), then there is some cardinal and cofinality preserving generic extension V[G] models ZFC + GCH in which, (a) (preservation) for kappa <= lambda regular, if V models ``kappa is lambda supercompact'', then V[G] models ``kappa is lambda supercompact'' and so that, (b) (equivalence) for kappa <= lambda regular, V[G] models ``kappa is lambda strong…
Here we deal with some problems posed by Matet. The first section deals with the existence of stationary subsets of [lambda]^{<kappa} with no unbounded subsets which are not stationary, where, of course, kappa is regular uncountable less or equal than lambda. In the second section we deal with the existence of such clubs. The proofs are easy but the result seems to be very surprising. Theorem 1.2 was proved some time ago by Baumgartner and is presented here for the sake of completeness.
Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to prove that any subset of kappa^{+ omega} can be coded into a subset, W of kappa^+ which, further, ``reshapes'' the interval [kappa, kappa^+), i.e., for all kappa < delta < kappa^+, kappa = (card delta)^{L[W cap delta]}. We sketch two applications of this result, assuming 0^sharp does not exist. First, we point out that this shows that any set can be coded by a…
Suppose that lambda = mu^+. We consider two aspects of the square property on subsets of lambda. First, we have results which show e.g. that for aleph_0 <= kappa =cf (kappa)< mu, the equality cf([mu]^{<= kappa}, subseteq)= mu is a sufficient condition for the set of elements of lambda whose cofinality is bounded by kappa, to be split into the union of mu sets with squares. Secondly, we introduce a certain weak version of the square property and prove that if mu is a strong limit, then this weak square property holds on lambda without any additional assumptions
If cf(kappa) = kappa, kappa^+< cf(lambda) = λ, then there is a stationary subset S of {delta<lambda:cf(delta)=kappa} in I[lambda]. Moreover, we can find <C_delta :delta in S>, C_delta a club of lambda, otp(C_delta)=kappa, guessing clubs and for each alpha<lambda we have: {C_delta \cap alpha: alpha \in nacc(C_delta)} has cardinality <lambda. Also, we prove that e.g. there is a stationary subset of S_{<aleph_1}(lambda) of cardinality cf(S_{<aleph_1}(lambda),subseteq) Then we prove the existence of nice filters when instead being normal filters on omega_1 they are normal filters with larger domai…
We prove that for any regular kappa and mu > kappa below the first fix point (lambda = aleph_lambda) above kappa, there is a graph with chromatic number > kappa, and mu^kappa nodes but every subgraph of cardinality < mu has chromatic number less than or equal to kappa.
We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly kappa+ many normal measures on the least measurable cardinal kappa. This answers a question of Stewart Baldwin. The methods generalize to higher cardinals, showing that the number of lambda strong compactness or lambda supercompactness measures on P_kappa(lambda) can be exactly lambda+, if lambda>kappa is a regular cardinal. We conclude with a list of open questions. Our proofs use a critical observation due to James Cummings.
We strengthen the revised GCH theorem by showing, e.g., that for lambda=cf(lambda)>beth_omega, for all but finitely many regular kappa<beth_omega, lambda is accessible on cofinality kappa in a weak version of it holds. In particular, lambda=2^mu=mu^+>beth_omega implies the diamond on lambda is restricted to cofinality kappa for all but finitely many kappa in Reg cap beth_omega and we strengthen the results on the middle diamond. Moreover, we get stronger results on the middle diamond.
We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for transparency, a model M is kappa-resplendent means: when we expand M by <kappa individual constants (c_i:i < alpha), if (M, c_i)_ {i<alpha} has an elementary extension expandable to be a model of T' where Th((M,c_i)_{i<alpha}) subseteq T', |T'| < kappa then already (M,c_i)_{i<α} can be expanded to a model of T'. Trivially any saturated model of cardinality lambda is la…
The pcf theorem (of the possible cofinality theory) was proved for reduced products prod_{i< kappa} lambda_i/I, where kappa < min_{i< kappa} lambda_i. Here we prove this theorem under weaker assumptions such as wsat(I)< min_{i< kappa} lambda_i, where wsat(I) is the minimal theta such that kappa cannot be delivered to theta sets notin I (or even slightly weaker condition). We also look at the existence of exact upper bounds relative to <_I (<_I-eub) as well as cardinalities of reduced products and the cardinals T_D(lambda). Finally we apply this to the problem of the depth of ultraproducts (and…
This is a continuation of "Some results on nonstationry ideal". The upper bound on precipitousness of NS_lambda^+ for a regular lambda given in this paper is proved to be exact.It is shown that saturatedness of NS_kappa^aleph_0 over inaccessible kappa requires at least o(kappa)=kappa^++.The upper bounds on the strength of NS_kappa precipitous for inaccessible kappa are reduced quite close to the lower bounds.
We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show that large pcf(a) implies existence of free sets. An example is that if pp(aleph_omega)> aleph_{omega_1} then for every algebra M of cardinality aleph_omega with countably many functions, for some a_n in M (for n< omega) we have a_n notin cl_M({a_l: l not= n, l<omega}). Then we present results complementary to those of section 2 (but not close enough): if IND…
We describe some (countably many) classes K^{n,e} of finite graphs and prove that if lambda^{aleph_0}= lambda then every lambda^+-chromatic graph of cardinal lambda^+ contains, for some n, e, all members of K^{n,e} as subgraphs. On the other hand, it is consistent for every regular infinite cardinal kappa that there is a kappa^+-chromatic graph on kappa^+ that contains finite subgraphs only from K^{n,e} .
The Kalikow problem for a pair (lambda, kappa) of cardinal numbers, lambda > kappa (in particular kappa =2) is whether we can map the family of omega --sequences from lambda to the family of omega --sequences from kappa in a very continuous manner. Namely, we demand that for eta, nu in lambda^omega we have: eta, nu are almost equal if and only if their images are. We show consistency of the negative answer e.g. for aleph_omega but we prove it for smaller cardinals. We indicate a close connection with the free subset property and its variants.
In their paper from 1981, Milner and Sauer conjectured that for any poset P, if cf(P)=lambda>cf(lambda)=kappa, then P must contain an antichain of size kappa. We prove that for lambda>cf(lambda)=kappa, if there exists a cardinal mu<lambda such that cov(lambda,mu,kappa,2)=lambda, then any poset of cofinality lambda contains lambda^kappa antichains of size kappa. The hypothesis of our theorem is very weak and is a consequence of many well-known axioms such as GCH, SSH and PFA. The consistency of the negation of this hypothesis is unknown.
Suppose t = (T,T_1, p) is a triple of two theories T subset T_1 in vocabularies tau subset tau_1 (respectively) of cardinality lambda and a tau_1-type p over the empty set; in the main case here is with T stable. We show the Hanf number for the property: "there is a model M_1 of T_1 which omits p, but M_1 restricted to tau is saturated" is larger than the Hanf number of L_{lambda^+, kappa} but smaller than the Hanf number of L_{(2^lambda)^+, kappa} when T is stable with kappa = kappa(T). In fact, we characterize the Hanf number of t when we fix (T, lambda) where T is a first order complete, la…
The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing sequence (lambda_i | i < kappa) of regular cardinals converging to mu such that lambda = tcf(prod_{i < kappa} lambda_i, <_{J^{bd}_kappa}). 2. Let mu be a strong limit cardinal and theta a cardinal above mu. Suppose that at least one of them has an uncountable cofinality. Then there is sigma_* < mu such that for every chi < theta the following holds: theta > …
In this short note we show that if lambda>aleph_1 is regular and lambda is not the successor of a singular cardinal of cofinality aleph_0, and G is a lambda-free abelian group of size lambda, then there is a free group G' subseteq G of size lambda.
Let K^0_lambda be the class of structures < lambda,<,A>, where A subseteq lambda is disjoint from a club, and let K^1_lambda be the class of structures < lambda,<,A>, where A subseteq lambda contains a club. We prove that if lambda = lambda^{< kappa} is regular, then no sentence of L_{lambda^+ kappa} separates K^0_lambda and K^1_lambda. On the other hand, we prove that if lambda = mu^+, mu = mu^{< mu}, and a forcing axiom holds (and aleph_1^L= aleph_1 if mu = aleph_0), then there is a sentence of L_{lambda lambda} which separates K^0_lambda and K^1_lambda .
A study is carried out of the elementary theory of quotients of symmetric groups in a similar spirit to [Sh:24]. Apart from the trivial and alternating subgroups, the normal subgroups of the full symmetric group S(mu) on an infinite cardinal mu are all of the form S_kappa(mu)= the subgroup consisting of elements whose support has cardinality <kappa for some kappa <= mu^+. A many-sorted structure M_{kappa lambda mu} is defined which, it is shown, encapsulates the first order properties of the group S_lambda (mu)/S_kappa (mu). Specifically, these two structures are (uniformly) bi-interpretable, …
We give some general criteria, when kappa-complete forcing preserves largeness properties -- like kappa-presaturation of normal ideals on lambda (even when they concentrate on small cofinalities). Then we quite accurately obtain the consistency strength ``NS_lambda is aleph_1-preserving'', for lambda > aleph_2 .
Let B(kappa, lambda) be the subalgebra of P(kappa) generated by [kappa]^{<= lambda}. It is shown that if B is any homomorphic image of B(kappa, lambda) then either |B|< 2^lambda or |B|=|B|^lambda, moreover if X is the Stone space of B then either |X| <= 2^{2^lambda} or |X|=|B|=|B|^lambda. This implies the existence of 0-dimensional compact T_2 spaces whose cardinality and weight spectra omit lots of singular cardinals of ``small'' cofinality.
We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent theories. Another way to say this is: we have to look at small enough neighborhood and use reasonably definable types to analyze a type. We note the results understable without reading. First, a parallel to the "stability spectrum", the "recounting of types", that is assume lambda = lambda^{< lambda} is large enough, M a saturated model of T of cardinality lamb…
We continue the investigations in the author's book on cardinal arithmetic, assuming some knowledge of it. We deal with the cofinality of (S_{<= aleph_0}(kappa), subseteq) for kappa real valued measurable (Section 3), densities of box products (Section 5,3), prove the equality cov(lambda, lambda, theta^+,2)=pp(lambda) in more cases even when cf(lambda)= aleph_0 (Section 1), deal with bounds of pp(lambda) for lambda limit of inaccessible (Section 4) and give proofs to various claims I was sure I had already written but did not find (Section 6).
The relations M(kappa,lambda,mu)->B [resp. B(sigma)] meaning that if A subset [kappa]^lambda with |A|=kappa is mu-almost disjoint then A has property B [resp. has a sigma-transversal] had been introduced and studied under GCH by Erdos and Hajnal in 1961. Our two main results here say the following: Assume GCH and rho be any regular cardinal with a supercompact [resp. 2-huge] cardinal above rho. Then there is a rho-closed forcing P such that, in V^P, we have both GCH and M(rho^{(+rho+1)},rho^+,rho) not-> B [resp. M(rho^{(+rho+1)},lambda,rho) not-> B(rho^+) for all lambda =< rho^{(+rho+1)}].
Given an ordinal delta <= lambda and a cardinal theta <= kappa, an ideal J on P_kappa(lambda) is said to be [delta]^{<theta}-normal if given B_e in J for e in P_theta(delta), the set of all a in P_kappa(lambda) such that a in B_e for some e in P_{|a cap theta|}(a cap delta) lies in J. We give necessary and sufficient conditions for the existence of such ideals and we describe the least one and we compute its cofinality.
An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC where for every natural number n greater than 1 and for every ordinal mu greater than or equal to aleph_n, we have (aleph_n, mu)-ITP.
We continue [Sh:b, Ch XIII] and [Sh:410]. Let W be an inner model of ZFC. Let kappa be a cardinal in V. We say that kappa-covering holds between V and W iff for all X in V with X subseteq ON and V models |X|< kappa, there exists Y in W such that X subseteq Y subseteq ON and V models |Y|< kappa. Strong kappa-covering holds between V and W iff for every structure M in V for some countable first-order language whose underlying set is some ordinal lambda, and every X in V with X subseteq lambda and V models |X|< kappa, there is Y in W such that X subseteq Y prec M and V models |Y|< kappa. We prove…
Does the class of linear orders have (one of the variants of) the so called (lambda, kappa)-limit model? It is necessarily unique, and naturally assuming some instances of G.C.H. we get some positive, i.e. existence results. More generally, letting T be a complete first order theory and for simplicity assume G.C.H., for regular lambda > kappa > |T| does T have (variants of) a (lambda,kappa)-limit models, except for stable T? For some, yes, the theory of dense linear order, for some, no. Moreover, for independent T we get negative, i.e. non-existence results. We deal more with linear orders.
We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an induced copy of the kappa-tree in G in the set theoretic sense with all edges having the same colour.
Suppose that lambda is the successor of a singular cardinal mu whose cofinality is an uncountable cardinal kappa. We give a sufficient condition that the club filter of lambda concentrating on the points of cofinality kappa is not lambda^+-saturated. The condition is phrased in terms of a notion that we call weak reflection. We discuss various properties of weak reflection
Saturation is (mu,kappa)-transferable in T if and only if there is an expansion T_1 of T with |T_1| = |T| such that if M is a mu-saturated model of T_1 and |M| \geq kappa then the reduct M|L(T) is kappa-saturated. We characterize theories which are superstable without the finite cover property (f.c.p.), or without f.c.p. as, respectively those where saturation is (aleph_0,lambda)-transferable or (kappa(T),lambda)-transferable for all lambda. Further if for some mu \geq |T|, 2^mu > mu^+, stability is equivalent to: or all mu \geq |T|, saturation is (μ,2^mu)-transferable.
The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M is linearly ordered by <, we will say that the linear ordering (M,<) characterizes kappa. It is known that if kappa is characterizable, then kappa plus is characterizable by a linear ordering. Also, if kappa is characterizable by a dense linear ordering with an increasing sequence of size kappa, then 2^kappa is characterizable. We show that if kappa is homo…
Using Shelah's revised GCH theorem we prove that if mu<beth_omega <= lambda are cardinals, then every mu-almost disjoint subfamily B of [lambda]^{beth_omega} is essentially disjoint, i.e. for each b from B there is a subset f(b) of b of size < |b| such that the family {b-f(b) b in B} is disjoint. We also show that if mu<=kappa<=lambda, and kappa is infinite, and (x) every mu-almost disjoint subfamily of [lambda]^kappa is essentially disjoint, then (xx) every mu-almost disjoint family B of subsets of lambda with |b|>=kappa for all b from B has a conflict-free colorings with kappa colors. Puttin…
We consider, for infinite cardinals kappa and alpha <= kappa^+, the group Pi(kappa,< alpha) of sequences of integers, of length kappa, with non-zero entries in fewer than alpha positions. Our main result tells when Pi(kappa,< alpha) can be embedded in Pi(lambda,< beta). The proof involves some set-theoretic results, one about familes of finite sets and one about families of ultrafilters.
For cardinals lambda, kappa, theta we consider the class of graphs of cardinality lambda which has no subgraph which is (kappa, theta)-complete bipartite graph. The question is whether in such a class there is a universal one under (weak) embedding. We solve this problem completely under GCH. Under various assumptions mostly related to cardinal arithmetic we prove nonexistence of universals for this problem and some related ones.
We address a number of problems on Boolean Algebras. For example, we construct, in ZFC, for any BA B, and cardinal kappa BAs B_1,B_2 extending B such that the depth of the free product of B_1,B_2 over B is strictly larger than the depths of B_1 and of B_2 than kappa. We give a condition (for lambda, mu and theta) which implies that for some BA A_theta there are B_1=B^1_{lambda, mu, theta} and B_2B^2_{lambda, mu, theta} such that Depth (B_t) <= mu and Depth (B_1 oplus_{A_theta} B_1) >= lambda. We then investigate for a fixed A, the existence of such B_1,B_2 giving sufficient and necessary condi…
section 2: We answer a question of Mekler Eklof on the closure operations of the incompactness spectrum. We answer a question of Foreman and Magidor on reflection of stationary subsets of S_{< aleph_2}(lambda) = {a subseteq lambda : |a| < aleph_2}]. section 3 - NPT is not transitive. We prove NPT(lambda, mu) + NPT(mu, kappa) not => NPT(lambda, kappa)
We present a forcing for blowing up 2^lambda and making ``many positive polarized partition relations'' (in a sense made precise in (c) of our main theorem) hold in the interval [lambda, 2^lambda]. This generalizes results of [276], Section 1, and the forcing is a ``many cardinals'' version of the forcing there.
This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras), measuring prod_{i<kappa}f(i) by a family of ideals and a family of sequences <B_i:i<kappa> with |B_i|<mu_i, and finally we deal with the existence of strongly almost disjoint families.
The main result is that for lambda strong limit singular failing the continuum hypothesis (i.e. 2^lambda > lambda^+), a polarized partition theorem holds.
We address several questions of Donald Monk related to irredundance and spread of Boolean algebras, gaining both some ZFC knowledge and consistency results. We show in ZFC that irr(B_0 times B_1)= max(irr(B_0),irr(B_1)). We prove consistency of the statement ``there is a Boolean algebra B such that irr(B)<s(B otimes B)'' and we force a superatomic Boolean algebra B_* such that s(B_*)=inc(B_*)=kappa, irr(B_*)=Id(B_*)=kappa^+ and Sub(B_*)=2^(kappa^+). Next we force a superatomic algebra B_0 such that irr(B_0)<inc(B_0) and a superatomic algebra B_1 such that t(B_1)>Aut(B_1). Finally we show that …
Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should work for R-modules, etc. As in earlier cases part of the work is analyzing how to move between the set theory and the algebra. Set theoretically we try to force a universe which satisfies G.C.H. and diamond holds for many stationary sets but, for every regular uncountable lambda, in some sense anything which "may" hold for some stationary set, does hold for s…
We investigate the structure of the lattice of clones on an infinite set X. We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg's theorem: "there are 2^2^kappa many maximal (=precomplete) clones on a set of size kappa." The clones we construct here do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a strong negative partition theorem we show that for many cardinals kappa there are 2^2^kappa many such clones on a set of size kappa. Finally, we show that on a weakly compact cardinal there are e…
A class K of structures is controlled if, for all cardinals lambda, the relation of L_{infty,lambda}-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive linear orders is controlled, while any pseudo-elementary class with the omega-independence property is not controlled.
