scholarly journals Universal graphs at the successor of a singular cardinal

2003 ◽  
Vol 68 (2) ◽  
pp. 366-388 ◽  
Author(s):  
Mirna Džamonja ◽  
Saharon Shelah

AbstractThe paper is concerned with the existence of a universal graph at the successor of a strong limit singular μ of cofinality ℵ0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for some such μ there are μ++ graphs on μ+ that taken jointly are universal for the graphs on μ+, while .The paper also addresses the general problem of obtaining a framework for consistency results at the successor of a singular strong limit starting from the assumption that a supercompact cardinal κ exists. The result on the existence of universal graphs is obtained as a specific application of a more general method.

2021 ◽  
Vol 27 (2) ◽  
pp. 221-222
Author(s):  
Alejandro Poveda

AbstractThe dissertation under comment is a contribution to the area of Set Theory concerned with the interactions between the method of Forcing and the so-called Large Cardinal axioms.The dissertation is divided into two thematic blocks. In Block I we analyze the large-cardinal hierarchy between the first supercompact cardinal and Vopěnka’s Principle (Part I). In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics (Part II and Part III).We commence Part I by investigating the Identity Crisis phenomenon in the region comprised between the first supercompact cardinal and Vopěnka’s Principle. As a result, we generalize Magidor’s classical theorems [2] to this higher region of the large-cardinal hierarchy. Also, our analysis allows to settle all the questions that were left open in [1]. Finally, we conclude Part I by presenting a general theory of preservation of $C^{(n)}$ -extendible cardinals under class forcing iterations. From this analysis we derive several applications. For instance, our arguments are used to show that an extendible cardinal is consistent with “ $(\lambda ^{+\omega })^{\mathrm {HOD}}<\lambda ^+$ , for every regular cardinal $\lambda $ .” In particular, if Woodin’s HOD Conjecture holds, and therefore it is provable in ZFC + “There exists an extendible cardinal” that above the first extendible cardinal every singular cardinal $\lambda $ is singular in HOD and $(\lambda ^+)^{\textrm {{HOD}}}=\lambda ^+$ , there may still be no agreement at all between V and HOD about successors of regular cardinals.In Part II and Part III we analyse the relationship between the Singular Cardinal Hypothesis (SCH) with other relevant combinatorial principles at the level of successors of singular cardinals. Two of these are the Tree Property and the Reflection of Stationary sets, which are central in Infinite Combinatorics.Specifically, Part II is devoted to prove the consistency of the Tree Property at both $\kappa ^+$ and $\kappa ^{++}$ , whenever $\kappa $ is a strong limit singular cardinal witnessing an arbitrary failure of the SCH. This generalizes the main result of [3] in two senses: it allows arbitrary cofinalities for $\kappa $ and arbitrary failures for the SCH.In the last part of the dissertation (Part III) we introduce the notion of $\Sigma $ -Prikry forcing. This new concept allows an abstract and uniform approach to the theory of Prikry-type forcings and encompasses several classical examples of Prikry-type forcing notions, such as the classical Prikry forcing, the Gitik-Sharon poset, or the Extender Based Prikry forcing, among many others.Our motivation in this part of the dissertation is to prove an iteration theorem at the level of the successor of a singular cardinal. Specifically, we aim for a theorem asserting that every $\kappa ^{++}$ -length iteration with support of size $\leq \kappa $ has the $\kappa ^{++}$ -cc, provided the iterates belong to a relevant class of $\kappa ^{++}$ -cc forcings. While there are a myriad of works on this vein for regular cardinals, this contrasts with the dearth of investigations in the parallel context of singular cardinals. Our main contribution is the proof that such a result is available whenever the class of forcings under consideration is the family of $\Sigma $ -Prikry forcings. Finally, and as an application, we prove that it is consistent—modulo large cardinals—the existence of a strong limit cardinal $\kappa $ with countable cofinality such that $\mathrm {SCH}_\kappa $ fails and every finite family of stationary subsets of $\kappa ^+$ reflects simultaneously.


2009 ◽  
Vol 09 (01) ◽  
pp. 139-157 ◽  
Author(s):  
ITAY NEEMAN

The tree property at κ+ states that there are no Aronszajn trees on κ+, or, equivalently, that every κ+ tree has a cofinal branch. For singular strong limit cardinals κ, there is tension between the tree property at κ+ and failure of the singular cardinal hypothesis at κ; the former is typically the result of the presence of strongly compact cardinals in the background, and the latter is impossible above strongly compacts. In this paper, we reconcile the two. We prove from large cardinals that the tree property at κ+ is consistent with failure of the singular cardinal hypothesis at κ.


2002 ◽  
Vol 02 (01) ◽  
pp. 81-89 ◽  
Author(s):  
YO MATSUBARA ◽  
SAHARON SHELAH

We prove that if λ is a strong limit singular cardinal and κ a regular uncountable cardinal < λ, then NSκλ, the non-stationary ideal over [Formula: see text], is nowhere precipitous. We also show that under the same hypothesis every stationary subset of [Formula: see text] can be partitioned into λκ disjoint stationary sets.


1997 ◽  
Vol 04 (05) ◽  
pp. 1063-1069 ◽  
Author(s):  
K. HERMANN

Many theoretical methods dealing with electronic and structural properties of single crystal surfaces rely on a convenient description of the surface and bulk periodicity at the same time. This can be achieved by using surface adapted lattice vectors [Formula: see text], where vectors [Formula: see text] define (h k l) net planes parallel to the surface while [Formula: see text] connects adjacent (h k l) net planes. For selected low index (h k l) surfaces of common crystals the construction of appropriate lattice vectors may be trivial. However, the general problem of determining a lattice basis adapted to a surface orientation which is described by Miller indices (h k l) in a general crystal lattice is more involved. In this paper we show that such bases, [Formula: see text], can be uniquely determined by linear transformations from the bulk lattice basis [Formula: see text]. The transformations depend on Miller indices (h k l) but not on the lattice type and can be quantified by number-theoretical methods. Thus, they are numerically stable and can be easily implemented in computational algorithms dealing with surfaces of most general crystals.


1999 ◽  
Vol 64 (2) ◽  
pp. 846-858
Author(s):  
Alexandru Baltag

In Barwise and van Benthem [6], the authors give a general method for obtaining interpolation and preservation theorems for fragments of L∞ω, those for which there is a co-inductive pebble game Γ characterizing equivalence in the logic. The method is exemplified by an analysis of the following fragments: L∞ω itself, its existential fragment , its positive fragment , the k-variable fragment (and its existential and positive subfragments) and the modal fragment (and its existential and positive subfragments).While most of their method is general, there is one part (showing that Γ has the Scott property relative to the fragment) that required a case-by-case analysis. The purpose of our paper is to replace this case-by-case analysis by a general theorem, and to illustrate this method by obtaining their kinds of results for some additional fragments of L∞ω.Our general problem can be stated in the following way: Given a “nice” fragment F of L∞ω (one satisfying some natural closure conditions), find a pebble game characterization Γ of “preservation of F-formulas” and prove that Γ has the Scott property with respect to F. Applying the Abstract Interpolation Theorem from [6], we can conclude that F has Γ-interpolation, and the corresponding preservation result. In this paper, we shall give an answer to this question. (Our answer is “sufficient” but we don't know if our conditions are necessary.)


2004 ◽  
Vol 69 (1) ◽  
pp. 255-264
Author(s):  
Mirna Džamonja ◽  
Péter Komjáth ◽  
Charles Morgan

AbstractWe prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal μ, of cofinality ω, such that every μ+-chromatic graph X on μ+ has an edge colouring c of X into μ colours for which every vertex colouring g of X into at most μ many colours has a g-colour class on which c takes every value.The paper also contains some generalisations of the above statement in which μ+ is replaced by other cardinals > μ.


2010 ◽  
Vol 75 (3) ◽  
pp. 1035-1065 ◽  
Author(s):  
Assaf Rinot

AbstractLet λ denote a singular cardinal. Zeman, improving a previous result of Shelah, proved that together with 2λ = λ+ implies ⋄S for every S ⊆ λ+ that reflects stationarily often.In this paper, for a set S ⊆ λ+, a normal subideal of the weak approachability ideal is introduced, and denoted by I[S; λ]. We say that the ideal is fat if it contains a stationary set. It is proved:1. if I[S; λ] is fat, then NSλ + ∣ S is non-saturated;2. if I[S; λ] is fat and 2λ = λ+, then ⋄S holds;3. implies that I[S; λ] is fat for every S ⊆ λ+ that reflects stationarily often;4. it is relatively consistent with the existence of a supercompact cardinal that fails, while I[S; λ] is fat for every stationary S ⊆ λ+ that reflects stationarily often.The stronger principle is studied as well.


1972 ◽  
Vol 37 (2) ◽  
pp. 247-267 ◽  
Author(s):  
Saharon Shelah

We prove here theorems of the form: if T has a model M in which P1(M) is κ1-like ordered, P2(M) is κ2-like ordered …, and Q1(M) is of power λ1, …, then T has a model N in which P1(M) is κ1′-like ordered …, Q1(N) is of power λ1′, …. (In this article κ is a strong-limit singular cardinal, and κ′ is a singular cardinal.)We also sometimes add the condition that M, N omits some types. The results are seemingly the best possible, i.e. according to our knowledge about n-cardinal problems (or, more precisely, a certain variant of them).


2017 ◽  
Vol 82 (4) ◽  
pp. 1229-1251
Author(s):  
TREVOR M. WILSON

AbstractWe prove several equivalences and relative consistency results regarding generic absoluteness beyond Woodin’s ${\left( {{\bf{\Sigma }}_1^2} \right)^{{\rm{u}}{{\rm{B}}_\lambda }}}$ generic absoluteness result for a limit of Woodin cardinals λ. In particular, we prove that two-step $\exists ^&#x211D; \left( {{\rm{\Pi }}_1^2 } \right)^{{\rm{uB}}_\lambda } $ generic absoluteness below a measurable limit of Woodin cardinals has high consistency strength and is equivalent, modulo small forcing, to the existence of trees for ${\left( {{\bf{\Pi }}_1^2} \right)^{{\rm{u}}{{\rm{B}}_\lambda }}}$ formulas. The construction of these trees uses a general method for building an absolute complement for a given tree T assuming many “failures of covering” for the models $L\left( {T,{V_\alpha }} \right)$ for α below a measurable cardinal.


2011 ◽  
Vol 11 (01) ◽  
pp. 61-85 ◽  
Author(s):  
MIRNA DŽAMONJA ◽  
JOUKO VÄÄNÄNEN

Let κ be a singular cardinal. Karp's notion of a chain model of size κ is defined to be an ordinary model of size κ along with a decomposition of it into an increasing union of length cf (κ). With a notion of satisfaction and (chain)-isomorphism such models give an infinitary logic largely mimicking first order logic. In this paper we associate to this logic a notion of a dynamic EF-game which gauges when two chain models are chain-isomorphic. To this game is associated a tree which is a tree of size κ with no κ-branches (even no cf (κ)-branches). The measure of how non-isomorphic the models are is reflected by a certain order on these trees, called reduction. We study the collection of trees of size κ with no κ-branches under this notion and prove that when cf (κ) = ω this collection is rather regular; in particular it has universality number exactly κ+. Such trees are then used to develop a descriptive set theory of the space cf (κ)κ. The main result of the paper gives in the case of κ strong limit singular an exact connection between the descriptive set-theoretic complexity of the chain isomorphism orbit of a model, the reduction order on the trees and winning strategies in the corresponding dynamic EF games. In particular we obtain a neat analog of the notion of Scott watershed from the Scott analysis of countable models.


Sign in / Sign up

Export Citation Format

Share Document