Saharon Shelah
We prove the consistency of ``CH + 2^{aleph_1} is arbitrarily large + 2^{aleph_1} not-> (omega_1 x omega)^2_2''. If fact, we can get 2^{aleph_1} not-> [omega_1 x omega]^2_{aleph_0}. In addition to this theorem, we give generalizations to other cardinals.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
An omega-coloring is a pair <f,B> where f:[B]^{2} ---> omega. The set B is the field of f and denoted Fld(f). Let f,g be omega-colorings. We say that f realizes the coloring g if there is a one-one function k:Fld(g) ---> Fld(f) such that for all {x,y}, {u,v} in dom(g) we have f({k(x),k(y)}) not= f({k(u),k(v)}) => g({x,y}) not= g({u,v}). We write f~g if f realizes g and g realizes f. We call the ~-classes of omega-colorings with finite fields identities. We say that an identity I is of size r if |Fld(f)|=r for some/all f in I. For a cardinal kappa and f:[kappa]^2 ---> omega we define I(f) to be…
Let 0<n^*< omega and f:X-> n^*+1 be a function where X subseteq omega backslash (n^*+1) is infinite. Consider the following set S_f= {x subset aleph_omega : |x| <= aleph_{n^*} & (for all n in X)cf(x cap alpha_n)= aleph_{f(n)}}. The question, first posed by Baumgartner, is whether S_f is stationary in [alpha_omega]^{< aleph_{n^*+1}}. By a standard result, the above question can also be rephrased as certain transfer property. Namely, S_f is stationary iff for any structure A=< aleph_omega, ... > there's a B prec A such that |B|= aleph_{n^*} and for all n in X we have cf(B cap aleph_n)= aleph_{f(…
We give some sufficient and necessary conditions on a forcing notion Q for preserving the forcing notion ([omega]^{aleph_0},supseteq^*) is proper. They cover many reasonable forcing notions.
Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with infinite models. Following Hodges, we say that T is relatively lambda-categorical if whenever M, N models T, P(M)=P(N), |P(M)|= lambda then there is an isomorphism i:M-> N which is the identity on P(M). T is relatively categorical if it is relatively lambda-categorical for every lambda. The question arises whether the relative lambda-categoricity of T for s…
We prove the consistency of the statement $\mathfrak{u}_{\aleph_ω}<2^{\aleph_ω}$. We show that the consistency strength of this statement is exactly a measurable cardinal $μ$ so that $o(μ)=μ^{++}$.
We prove the consistency of the failure of the singular cardinals hypothesis at $\aleph_ω$ together with the reflection of all stationary subsets of $\aleph_{ω+1}$. This shows that two classic results of Magidor (from 1977 and 1982) can hold simultaneously.
Let kappa be an uncountable cardinal and the edges of a complete graph with kappa vertices be colored with aleph_0 colors. For kappa >2^{aleph_0} the Erdős-Rado theorem implies that there is an infinite monochromatic subgraph. However, if kappa <= 2^{aleph_0}, then it may be impossible to find a monochromatic triangle. This paper is concerned with the latter situation. We consider the types of colorings of finite subgraphs that must occur when kappa <= 2^{aleph_0}. In particular, we are concerned with the case aleph_1 <= kappa <= aleph_omega
Starting with infinitely many supercompact cardinals, we show that the tree property at every cardinal $\aleph_n$, $1 < n <ω$, is consistent with an arbitrary continuum function below $\aleph_ω$ which satisfies $2^{\aleph_n} > \aleph_{n+1}$, $n<ω$. Thus the tree property has no provable effect on the continuum function below $\aleph_ω$ except for the restriction that the tree property at $κ^{++}$ implies $2^κ>κ^+$ for every infinite $κ$.
It is consistent that for every n >= 2, every stationary subset of omega_n consisting of ordinals of cofinality omega_k where k = 0 or k <= n-3 reflects fully in the set of ordinals of cofinality omega_{n-1}. We also show that this result is best possible.
We show using a proof of the Global Square property in Core Models below a measurable of Mitchell order o(kappa)=kappa^++ (a result originally due to Jensen & Zeman) that Foreman and Magidor's Mutual Stationarity property MS(Aleph_n (1<n<omega), Cof(omega_1)) implies the existence of inner models with measurables of high Mitchell order. This MS property states that any sequence of independently chosen stationary subsets S_n of the Aleph_n (of fixed cofinality omega_1) is mutually stationary below aleph_omega.
We present two different types of models where, for certain singular cardinals lambda of uncountable cofinality, lambda -> (lambda, omega+1)^2, although lambda is not a strong limit cardinal. We announce, here, and will present in a subsequent paper, that, for example, consistently, aleph_{omega_1} not-> (aleph_{omega_1}, omega+1)^2 and consistently, 2^{aleph_0} not-> (2^{aleph_0},omega +1)^2 .
We prove the consistency result from the title. By forcing we construct a model of g=aleph_1, b=cf(Sym(omega))=aleph_2.
After the main gap theorem was proved (see [Sh:c]), in discussion, Harrington expressed a desire for a finer structure - of finitary character (when we have a structure theorem at all). I point out that the logic L_{infty,aleph_0}(d.q.) (d.q. stands for dimension quantifier) does not suffice: e.g., for T=Th(lambda x 2^ω,E_n)_{n<omega} where (alpha,eta)E_n(beta,nu) =: eta|n=nu|n and for a subset S of 2^omega we define M_S = M | {(alpha,eta): [eta in S -> alpha<omega_1] and [eta in 2^ωbackslash S -> alpha<omega]}. Hence, it seems to me we should try L_{infty,aleph_epsilon}(d.q.) (essentially, in…
In the early 1970's S.Tennenbaum proved that all countable models of PA^- + forall_1-Th(N) are embeddable into the reduced product N^omega/F, where F is the cofinite filter. In this paper we show that if M is a model of PA^- + forall_1-Th(N), and |M|= aleph_1, then M is embeddable into N^omega/D, where D is any regular filter on omega.
The Noetherian type of a space X, Nt(X), is the least cardinal kappa such that X has a base B such that every element of the base is contained in less than kappa many elements of the base. Denote X the space obtained from 2^{aleph_omega} by declaring the G_delta sets to be open. Milovich proved that if Square_{aleph_omega} holds and (aleph_omega)^omega=aleph_{omega+1} then Nt(X)=omega_1. Answering a question of Spadaro, we show that if (aleph_omega)^omega=aleph_{omega+1} and a strong form of Chang Conjecture holds for aleph_ωthen Nt(X)>omega_1.
The following results are proved: (a) In a model obtained by adding aleph_2 Cohen reals, there is always a c.c.c. complete Boolean algebra without the weak Freese-Nation property. (b) Modulo the consistency strength of a supercompact cardinal, the existence of a c.c.c. complete Boolean algebras without the weak Freese-Nation property consistent with GCH. (c) Under some consequences of the negation of 0^#, the weak Freese-Nation property of (P(omega),subseteq) is equivalent to the weak Freese-Nation property of any of C(kappa) or R(kappa) for uncountable kappa. (d) Modulo consistency of (aleph_…
Let (A) and (B) be two first order structures of the same vocabulary. We shall consider the Ehrenfeucht-Fra{i}sse-game of length omega_1 of A and B which we denote by G_{omega_1}(A,B). This game is like the ordinary Ehrenfeucht-Fraisse-game of L_{omega omega} except that there are omega_1 moves. It is clear that G_{omega_1}(A,B) is determined if A and B are of cardinality <= aleph_1. We prove the following results: Theorem A: If V=L, then there are models A and B of cardinality aleph_2 such that the game G_{omega_1}(A,B) is non-determined. Theorem B: If it is consistent that there is a measura…
We prove in ZFC, no psi in L_{omega_1,omega}[Q] have unique model of uncountable cardinality, this confirms theBaldwin conjecture. But we analyze this in more general terms. We introduce and investigate a.e.c. and also versions of limit models, and prove some basic properties like representation by PC class, for any a.e.c. For PC_{aleph_0}-representable a.e.c. we investigate the conclusion of having not too many non-isomorphic models in aleph_1 and aleph_2, but have to assume 2^{aleph_0}<2^{aleph_1} and even 2^{aleph_1}<2^{aleph_2}.
It is consistent that there is a set mapping from the four-tuples of omega_n into the finite subsets with no free subsets of size t_n for some natural number t_n. For any n< omega it is consistent that there is a set mapping from the pairs of omega_n into the finite subsets with no infinite free sets.
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…
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 begin with the existence of groups with trivial duals for cardinals aleph_n (n in omega). Then we derive results about strongly aleph_n-free abelian groups of cardinality aleph_n (n in omega) with prescribed free, countable endomorphism ring. Finally we use combinatorial results of [Sh:108], [Sh:141] to give similar answers for cardinals >aleph_omega. As in Magidor and Shelah [MgSh:204], a paper concerned with the existence of kappa-free, non-free abelian groups of cardinality kappa, the induction argument breaks down at aleph_omega. Recall that aleph_omega is the first singular cardinal an…
We prove that for every singular cardinal mu of cofinality omega, the complete Boolean algebra compP_mu(mu) contains as a complete subalgebra an isomorphic copy of the collapse algebra Comp Col(omega_1,mu^{aleph_0}). Consequently, adding a generic filter to the quotient algebra P_mu(mu)=P(mu)/[mu]^{<mu} collapses mu^{aleph_0} to aleph_1. Another corollary is that the Baire number of the space U(mu) of all uniform ultrafilters over mu is equal to omega_2. The corollaries affirm two conjectures by Balcar and Simon. The proof uses pcf theory.
Let lambda be aleph_0 or a strong limit of cofinality aleph_0. Suppose that (G_m,p_{m,n}:m =< n<omega) and (H_m,p^t_{m,n}: m=< n < omega) are projective systems of groups of cardinality less than lambda and suppose that for every n<omega there is a homomorphism h:H_n-->G_n such that all the diagrams commute. If for every mu<lambda there exists (f_i in G_omega:i<mu) such that for distinct i,j we have: f_i f_j^{-1} notin h_omega(H_omega), then there exists (f_i in G_omega:i<2^lambda) such that for distinct i,j we have f_i f_j^{-1} notin h_omega(H_omega).
We prove that if ZF is consistent then ZFC+GCH is consistent with the following statement: There is for every k<omega a model of cardinality aleph_1 which is L_{infty,omega_1}-equivalent to exactly k non-isomorphic models of cardinality aleph_1. In order to get this result we introduce ladder systems and colourings different from the ``standard'' counterparts, and prove the following purely combinatorial result: For each prime number p and positive integer m it is consistent with ZFC+GCH that there is a ``good'' ladder system having exactly p^m pairwise nonequivalent colourings.
It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of Erdos. It is also consistent that there is a graph X with Chr(X)=|X|= aleph_1 such that if Y is a graph all whose finite subgraphs occur in X then Chr(Y)<=aleph_2 (so the Taylor conjecture may fail).
Whenever x is a tame cardinal invariant and ZFC+large cardinals proves that x=aleph one implies WCG then ZFC+large cardinals proves that x=aleph one implies b=aleph one, and b=aleph one implies WCG. Here WCG is a certain prediction principle on omega one. This theorem is one of the many possible interpolation theorems of this kind.
We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all bounded X subset aleph_{|alpha|^+}, M_n^#(X) exists. Theorem B: Let kappa be a singular cardinal of uncountable cofinality. If {alpha<kappa| 2^alpha=alpha^+} is stationary as well as co-stationary then for all n< omega and for all bounded X subset kappa, M_n^#(X) exists. Theorem A answers a question of Gitik and Mitchell, and Theorem B yields a lower bound for an …
For g < f in omega^omega we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force aleph_1 many different values for different functions (f,g). In the language of Blass: There may be aleph_1 many distinct uniform Pi^0_1 characteristics.
We prove that if Q is a nw-nep forcing then it cannot add a dominating real. We also prove that Amoeba forcing cannot be P(X)/I if I is an aleph_1-complete ideal.
The main result is Theorem: Let A be an R-algebra, mu, lambda be cardinals such that |A|<=mu=mu^{aleph_0}<lambda<=2^mu. If A is aleph_0-cotorsion-free or A is countably free, respectively, then there exists an aleph_0-cotorsion-free or a separable (reduced, torsion-free) R-module G respectively of cardinality |G|=lambda with End_RG=A oplus Fin G.
The point of departure for the present work is Barry Mitchell's 1972 theorem that the cohomological dimension of $\aleph_n$ is $n+1$. We record a new proof and mild strengthening of this theorem; our more fundamental aim, though, is some clarification of the higher-dimensional infinitary combinatorics lying at its core. In the course of this work, we describe simplicial characterizations of the ordinals $ω_n$, higher-dimensional generalizations of coherent Aronszajn trees, bases for critical inverse systems over large index sets, nontrivial $n$-coherent families of functions, and higher-dimens…
We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context: the number of models of a countable first order T of cardinality aleph_alpha is either >=|alpha| for every aleph_αor it has a small upper bound (close to beth_2).
A subgroup G \leq Z^omega exhibits the Specker phenomenon if every homomorphism G \to Z maps almost all unit vectors to 0. We give several combinatorial characterizations of the cardinal se, the size of the smallest G \leq Z^omega exhibiting the Specker phenomenon. We also prove the consistency of b < e, where b is the unbounding number and e the evasion number introduced recently by Blass. Finally we show that e \geq \min { aleph_0--e , cov(M) }, where aleph_0--e is the aleph_0--evasion number (the uniformity of the evasion ideal) and cov(M) is the covering number of the meager ideal. All the…
In this paper we prove the equiconsistency of ``Every omega_1 tree which is first order definable over H_{omega_1} has a cofinal branch'' with the existence of a Pi^1_1 reflecting cardinal. The proof uses a definable version of Ramsey theorem on aleph_1 which is again equiconsistent with a Pi^1_1 reflecting cardinal. We also prove that the addition of $MA$ to the definable tree property increases the consistency strength to that of a weakly compact cardinal. Finally we comment on the generalization to higher cardinals.
We prove in ZFC that the Baer-Specker group Z^omega has 2^{aleph_1} non-free pure subgroups of cardinality aleph_1 which are almost disjoint: there is no non-free subgroup embeddable in any pair.
Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two of them the tau(T)-reducts of one is not elementarily embeddable into the tau(T)-reduct of the other, thus completing the investigation of [Sh:a, Ch. VIII]. Note the difference with the case of unstable T: there lambda > |T_1| + aleph_0 suffices. By [Sh:E59] it suffices for every such lambda to find a complicated enough family of trees with omega + 1 levels …
We prove that if cf(lambda) > aleph_0 and 2^{cf(lambda)}<lambda, then lambda->(lambda,omega+1)^2.
In this paper the Erdos-Rado theorem is generalized to the class of well founded trees. We define an equivalence relation on the class rs(infty)^{< aleph_0} (finite sequences of decreasing sequences of ordinals) with aleph_0 equivalence classes, and for n< omega a notion of n-end-uniformity for a colouring of rs(infty)^{< aleph_0} with mu colours. We then show that for every ordinal alpha, n< omega and cardinal mu there is an ordinal lambda so that for any colouring c of T=rs(lambda)^{< aleph_0} with mu colours, T contains S isomorphic to rs(alpha) so that c rest S^{< aleph_0} is n-end uniform…
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…
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 construct non-isomorphic models M, N, e.g. of cardinality aleph_1 such that in the Ehrenfeucht-Fraisse game of length zeta < omega_1 the isomorphism player wins
A group G that is not finitely generated can be written as the union of a chain of proper subgroups. The cofinality spectrum of G, written CF(S), is the set of regular cardinals lambda such that G can be expressed as the union of a chain of lambda proper subgroups. The cofinality of G, written c(G), is the least element of CF(G). We show that it is consistent that CF(S) is quite a bizarre set of cardinals. For example, we prove Theorem (A): Let T be any subset of omega setminus {0}. Then it is consistent that aleph_n in CF(S) if and only if n in T . One might suspect that it is consistent that…
We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]
Let $CH$ be the class of compacta (i.e., compact Hausdorff spaces), with $BS$ the subclass of Boolean spaces. For each ordinal $alpha$ and pair $(K,L)$ of subclasses of $CH$, we define $Lev_{>=alpha}(K,L)$, the class of maps of level at least $alpha$ from spaces in $K$ to spaces in $L$, in such a way that, when $alpha < omega$, $Lev}_{>=alpha}(BS,BS)$ consists of the Stone duals of Boolean lattice embeddings that preserve all prenex first-order formulas of quantifier rank $alpha$. Maps of level $>=0$ are just the continuous surjections, and the maps of level $>=1$ are the co-existential maps. …
We prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an omega-language $L(A)$ accepted by a Büchi 1-counter automaton $A$. We prove the following surprising result: there exists a 1-counter Büchi automaton $A$ such that the cardinality of the complement $L(A)^-$ of the omega-language $L(A)$ is not determined by ZFC: (1). There is a model $V_1$ of ZFC in which $L(A)^-$ is countable. (2). There is a model $V_2$ of ZFC in which $L(A…
We throw some light on the question: is there a MAD family (= a family of infinite subsets of N, the intersection of any two is finite) which is completely separable (i.e. any X subseteq N is included in a finite union of members of the family or include a member of the family). We prove that it is hard to prove the consistency of the negation: (a) if 2^{aleph_0} < aleph_omega, then there is such a family (b) if there is no such families then some situation related to pcf holds whose consistency is large.
Suppose that kappa is a singular cardinal of cofinality omega and GCH holds. Assume that for every n<omega the set of alphas with o(alpha)>= alpha^{+n} is unbounded in kappa.Then there is a cardinal preserving extension satisfying 2^kappa=kappa^++ and GCH below kappa. By a result of W. Mitchell and the author the assumptions are optimal.
We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not use Skolem function (which do not matter for proving compactness of logics but still are of interest). Let lambda be 2^mu if regular and its successor otherwise. Model theoretically we investigate notions of bigness of types, usually those are ideals of the set of formulas in a model, definable in appropriate sense. We build a model of cardinality lambda^plus …
A Variant Of Chaitin's Omega function
本文研究了Chaitin的Omega函数的一个变种，探讨了其在可计算性、算法随机性和分析中的性质，并揭示了其与其它Omega变种之间的联系。
We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a well-ordering, then so is phi(alpha,X)", where alpha is a fixed computable ordinal and phi the two-placed Veblen function. For the former statement, we show that omega iterations of the Turing jump are necessary in the proof and that the statement is equivalent to ACA_0^+ over RCA_0. To prove the latter statement we need to use omega^alpha iterations of the Turing jump, and we show that the statement is equivalent to P…
We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove effective versions of these results. In particular, for each non null recursive ordinal alpha, there exists a recursive finitary language A such that A^omega is Sigma^0_alpha-complete (respectively, Pi^0_alpha-complete). To do this, we prove effective versions of a result by Kuratowski, describing a Borel set as the range of a closed subset of the Baire space by…
A space X is called an alpha-Toronto space if X is scattered of Cantor-Bendixson rank alpha and is homeomorphic to each of its subspaces of same rank. We answer a question of Steprans by constructing a countable alpha-Toronto space for each alpha<=omega. We also construct consistent examples of countable alpha-Toronto spaces for each alpha<omega_1.
We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model of ``ZFC + Omega is the least inaccessible limit of measurable limits of supercompact cardinals + f :Omega-->2 is a function'', then there is a partial ordering P in V so that for Vbar = V^P, Vbar_Omega models ``ZFC + There is a proper class of compact cardinals + If f(alpha) = 0, then the alpha-th compact cardinal isn't supercompact + If f(alpha) = 1, then t…
In [Sh:89] we, answering a question of Monk, have explicated the notion of ``a Boolean algebra with no endomorphisms except the ones induced by ultrafilters on it'' (see section 2 here) and proved the existence of one with character density aleph_0, assuming first diamondsuit_{aleph_1} and then only CH. The idea was that if h is an endomorphism of B, not among the ``trivial'' ones, then there are pairwise disjoint D_n in B with h(d_n) not subset d_n. Then we can, for some S subset omega, add an element x such that d <= x for n in S, x cap d_n=0 for n not in S while forbidding a solution for {y…
We show that, from a topological point of view, considering the Borel and the Wadge hierarchies, 1-counter Büchi automata have the same accepting power than Turing machines equipped with a Büchi acceptance condition. In particular, for every non null recursive ordinal alpha, there exist some Sigma^0_alpha-complete and some Pi^0_alpha-complete omega context free languages accepted by 1-counter Büchi automata, and the supremum of the set of Borel ranks of context free omega languages is the ordinal gamma^1_2 which is strictly greater than the first non recursive ordinal. This very surprising res…
For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha<lambda) of distinct elements such that |(eta_alpha+B) cap (eta_beta+B)|>5 for all alpha,beta<lambda, but (2) there is no perfect set of such eta's. The construction closely follows the one from Shelah math.LO/9802134
Higman proved in 1952 that every free group is non-commutatively slender, this is to say that if G is a free group and h is a homomorphism from the countable complete free product (X_omega Z) to G, then there exists a finite subset F of omega and a homomorphism h:*_{i in F} Z --> G such that h=h rho_F, where rho_F is the natural map from (X_{i in omega})Z to *_{i in F}Z . Corresponding to the abelian case this phenomenon was called the non-commutative Specker Phenomenon. In this paper we show that Higman's result fails if one passes from countable to uncountable. In particular, we show that fo…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。