Related papers: Coloring ordinals by reals

We generalize a formula due to Macdonald that relates the singular Betti numbers of $X^{n}/G$ to those of $X$, where $X$ is a compact manifold and $G$ is any subgroup of the symmetric group $S_{n}$ acting on $X^{n}$ by permuting…

We prove that the entropy compression method systematized by L. Esperet and A. Parreau can be applied to any problem formulated in the variable version of the Lovasz Local Lemma. As an application, we prove the existence of legitimate…

This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…

In this paper we give an ordinal analysis of a set theory with $\Pi_{1}$-Collection.

We study the structural regularities and irregularities of the reals in inner models of set theory. Starting with $L$, G\"{o}del's constructible universe, our study of the reals is thus two-fold. On the one hand, we study how their…

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 use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

Miller's 1937 splitting theorem was proved for pairs of cardinals $(\n,\rho)$ in which $n$ is finite and $\rho$ is infinite. An extension of Miller's theorem is proved here in ZFC for pairs of cardinals $(\nu,\rho)$ in which $\nu$ is…

Following and developing ideas of R. Karasev (Covering dimension using toric varieties, arXiv:1307.3437), we extend the Lebesgue theorem (on covers of cubes) and the Knaster-Kuratowski-Mazurkiewicz theorem (on covers of simplices) to…

ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…

Considering the successful theory of multiple summing multilinear operators as a prototype, we introduce the classes of multiple Cohen strongly p-summing multilinear operators and polynomials. The adequacy of these classes under the…

Order types are a well known abstraction of combinatorial properties of a point set. By Mn\"ev's universality theorem for each semi-algebraic set $V$ there is an order type with a realization space that is \emph{stably equivalent} to $V$.…

We show that the Abraham-Rubin-Shelah Open Coloring Axiom is consistent with a large continuum, in particular, consistent with $2^{\aleph_0}=\aleph_3$. This answers one of the main open questions from the 1985 paper of Abraham-Rubin-Shelah.…

The purpose of the paper is to produce models V_1 \subset V_2 such that adding kappa-many Cohen reals to V_2 adds lambda Cohen reals to V_1. Some of the results: 1. Suppose that V satisfies GCH, kappa = \cup kappa_n= \cup o(kappa_n). Then…

This paper is concerned with the extent to which the Skolem-Bang theorems in Diophantine approximations generalise from the standard setting of $<R,Z>$ to structures of the form $<F,I>$, where $F$ is an ordered field and $I$ is an integer…

Let $G$ be a simple graph with $n$ vertices and list chromatic number $\chi_\ell(G)=\chi_\ell$. Suppose that $0\leq t\leq \chi_\ell$ and each vertex of $G$ is assigned a list of $t$ colors. Albertson, Grossman and Haas [1] conjectured that…

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

We show that adding a random real number destroys a large fragment of Martin's axiom, namely Martin's axiom for partial orders that have precalibre-$\aleph_1$, thus answering an old question of J. Roitman [9]. We also answer a question of…

We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We…

A Gleason-type theorem is proved for two restricted classes of informationally complete POVMs in the qubit case. A particular (incomplete) Kochen-Specker colouring, suggested by Appleby in dimension three, is generalized to arbitrary…