相关论文: On idealized versions of $\pr_1(\mu^+,\mu^+,\mu^+,…

We formulate and prove (in {\sf ZFC}) a strong coloring theorem which holds at successors of singular cardinals, and use it to answer several questions concerning Shelah's principle $Pr_1(\mu^+,\mu^+,\mu^+,\cf(\mu))$ for singular $\mu$.

We establish a coloring theorem for successors of a singular cardinals, and use it prove that for any such cardinal $\mu$, we have $\mu^+\nrightarrow[\mu^+]^2_{\mu^+}$ if and only if $\mu^+\nrightarrow[\mu^+]^2_{\theta}$ for arbitrarily…

Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…

We prove the consistency of $\binom{\mu^+}{\mu}\nrightarrow\binom{\mu^+ \omega_1}{\mu\ \mu}$ where $\mu$ is a strong limit singular cardinal of countable cofinality. This result can be forced at limit of measurable cardinals and at small…

Some models of combinatorial principles have been obtained by collapsing a huge cardinal in the case of the successors of regular cardinals. For example, saturated ideals, Chang's conjecture, polarized partition relations, and transfer…

We get a quite maximal version of the colouring property $Pr_1$ by proving $Pr_1(\lambda,\lambda,\lambda,\theta)$ when $\lambda = \partial^+, \partial > \theta$ are regular cardinals.

We deal here with colorings of the pair (mu^+, mu), when mu is a strong limit and singular cardinal. We show that there exists a coloring c, with no refinement. It follows, that the properties of identities of (mu^+, mu) when mu is…

Let $\mu$ be a strong limit singular cardinal. We prove that if $2^{\mu} > \mu^+$ then $\binom{\mu^+}{\mu}\to \binom{\tau}{\mu}_{<{\rm cf}(\mu)}$ for every ordinal $\tau<\mu^+$. We obtain an optimal positive relation under $2^\mu = \mu^+$,…

In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish…

We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…

We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection…

We extend to singular cardinals the model-theoretical relation $\lambda \stackrel{\kappa}{\Rightarrow} \mu$ introduced in P. Lipparini, The compactness spectrum of abstract logics, large cardinals and combinatorial principles, Boll. Unione…

Denote by $\continuum=2^{\aleph_0}$ the cardinal of continuum. We construct an intriguing family $(P_\alpha: \alpha\in\continuum)$ of prime $z$-ideals in $\C_0(\reals)$ with the following properties: If $f\in P_{i_0}$ for some…

We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam's theorem and its extension by Hajnal,…

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

We generalize to the relations $(\lambda, \mu) \stackrel{\kappa}{\Rightarrow} (\lambda', \mu')$ and $\alm (\lambda, \mu) \stackrel{\kappa}{\Rightarrow} \alm (\lambda', \mu')$ some results obtained in Parts II and IV. We also present a…

We introduce various colouring principles which generalise the so-called "onto mapping principle" of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow to…

We prove that a variety of generalized cardinal characteristics, including meeting numbers, the reaping number, and the dominating number, satisfy an analogue of the Galvin-Hajnal theorem, and hence also of Silver's theorem, at singular…

We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…

We show that, given an infinite cardinal $\mu$, a graph has colouring number at most $\mu$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its…