Peter Komjath, Saharon Shelah
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} .
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
For a regular uncountable cardinal kappa, we discuss the order relationship between the unbounding and dominating numbers on kappa and cardinal invariants of the higher meager ideal M_kappa. In particular, we obtain a complete characterization of add(M_kappa) and cof(M_kappa) in terms of cov(M_kappa) and non(M_kappa) and unbounding and dominating numbers, and we provide models showing that there are no restrictions on the value of non(M_kappa) in the degenerate case 2^{<kappa} > kappa except 2^{<kappa} leq non(M_kappa) leq 2^kappa. The corresponding question for cof(M_kappa) remains open. Our …
We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues [Sh:587]. We also deal with complimentary combinatorial results.
We deal with the problem of preserving various versions of completeness in (< kappa) --support iterations of forcing notions, generalizing the case ``S --complete proper is preserved by CS iterations for a stationary co-stationary S subseteq omega_1''. We give applications to Uniformization and the Whitehead problem. In particular, for a strongly inaccessible cardinal kappa and a stationary set S subseteq kappa with fat complement we can have uniformization for < A_delta : delta in S'>, A_delta subseteq delta = sup A_delta, cf(delta)=otp(A_delta) and a stationary non-reflecting set S' subseteq…
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 prove the consistency of irr(prod limits_{i<kappa}B_i/D)< prod limits_{i<kappa}irr(B_i)/D, where D is an ultrafilter on kappa and each B_i is a Boolean Algebra. This solves the last problem of this form from the Monk's list of problems, that is number 35. The solution applies to many other properties, e.g., Souslinity. Next, we get similar results with kappa = aleph_1 (easily we cannot have it for kappa=aleph_0) and Boolean Algebras B_i (i< kappa) of cardinality < beth_{omega_1}.
For a cardinal kappa and a model M of cardinality kappa let No(M) denote the number of non-isomorphic models of cardinality kappa which are L_{infty,kappa}--equivalent to M. In [Sh:133] Shelah established that when kappa is a weakly compact cardinal and mu<=kappa is a nonzero cardinal, there exists a model M of cardinality kappa with No(M)=mu. We prove here that if kappa is a weakly compact cardinal, the question of the possible values of No(M) for models M of cardinality kappa is equivalent to the question of the possible numbers of equivalence classes of equivalence relations which are Sigma…
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.
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.
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…
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…
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 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.
It is well-known that the automorphism towers of infinite centreless groups of cardinality kappa terminate in less than (2^{kappa})^+ steps. But an easy counting argument shows that (2^{kappa})^+ is not the best possible bound. However, in this paper, we will show that it is impossible to find an explicit better bound using ZFC.
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.
Let C denote any of the following cardinal characteristics of Boolean algebras: incomparability, spread, character, pi-character, hereditary Lindelof number, hereditary density. It is shown to be consistent that there exists a sequence <B_i:i<kappa> of Boolean algebras and an ultrafilter D on kappa such that C(prod_{i<kappa}B_i/D)<|prod_{i<kappa}C(B_i)/D|. This answers a number of problems posed by Monk.
We provide a partial result on Taylor's modularity conjecture, and several related problems. Namely, we show that the interpretability join of two idempotent varieties that are not congruence modular is not congruence modular either, and we prove an analogue for idempotent varieties with a cube term. Also, similar results are proved for linear varieties and the properties of congruence modularity, having a cube term, congruence $n$-permutability for a fixed $n$, and satisfying a non-trivial congruence identity.
Contents of this issue: Workshops on SPM themes; Second workshop on Coverings, Selections and Games in Topology (SPM05); Analysis and Descriptive Set Theory Workshop; Descriptive set theory: Effective methods, equivalence relations; Analysis: typical functions, level sets structure; Organizational and additional details; Research announcements; Cardinal restrictions on some homogeneous compacta; Filters: Topological congruence relations on groups; Inverse Limits and Function Algebras; Ultrafilters and partial products of infinite cyclic groups; More on regular reduced products; Consistency of …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。