Related papers: Guessing models, trees, and cardinal arithmetic

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

The arboreal gas is the random (unrooted) spanning forest of a graph in which each forest is sampled with probability proportional to $\beta^{\# \text{edges}}$ for some $\beta\geq 0$, which arises as the $q\to 0$ limit of the…

We show that Shelah cardinals are preserved under the canonical $GCH$ forcing notion. We also show that if $GCH$ holds and $F:REG\rightarrow CARD$ is an Easton function which satisfies some weak properties, then there exists a cofinality…

The present paper is concerned with the relation between recurrence axioms and Laver-generic large cardinal axioms in light of principles of generic absoluteness and the Ground Axiom. M. Viale proved that Martin's Maximum$^{++}$ together…

Let $\Omega\subset\mathbb{R}^n$ be a bounded Lipschitz domain. For any $\epsilon\in (0,1)$ we show that for any Dirichlet eigenvalue $\lambda_k(\Omega)>\Lambda(\epsilon,\Omega)$, it holds \begin{align*} k&\le…

If $X$ is a topological space and $\kappa$ is a cardinal then $\mathsf{BA}_\kappa (X)$ is the statement that for each pair $A, B \subseteq X$ of $\kappa$-dense subsets there is an autohomeomorphism $h:X \to X$ mapping $A$ to $B$. In…

In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…

We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin forcing such that all its small subsets are sigma-centered…

We investigate the consistency strength of the statement: $\kappa$ is weakly compact and there is no tree on $\kappa$ with exactly $\kappa^{+}$ many branches. We show that this statement fails strongly (in the sense that there is a sealed…

Courcelle's celebrated theorem states that all MSO-expressible properties can be decided in linear time on graphs of bounded treewidth. Unfortunately, the hidden constant implied by this theorem is a tower of exponentials whose height…

We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable $P$-points, definable tight MAD families and definable selective independent families. As a result, we…

We conclude from Goedel's Theorem VII of his seminal 1931 paper that every recursive function f(x_{1}, x_{2}) is representable in the first-order Peano Arithmetic PA by a formula [F(x_{1}, x_{2}, x_{3})] which is algorithmically verifiable,…

The present paper has three themes. First, we continue the investigations started in Judah, Roslanowski and Shelah \math.LO/9310224 and Roslanowski and Shelah math.LO/9807172, math.LO/9703222, and we investigate the method of norms on…

We recently formulated a new large-cardinal axiom of strength intermediate between a totally indescribable cardinal and an $\omega$-Erd\H{o}s cardinal, positing the existence of what we called an "extremely reflective cardinal", and we…

We present two ways in which the model $L({\mathbb R})$ is canonical assuming the existence of large cardinals. We show that the theory of this model, with {\em ordinal} parameters, cannot be changed by small forcing; we show further that a…

Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability for models of fragments of ${\rm ZFC}$,…

Dobrinen, Hathaway and Prikry studied a forcing $\mathbb{P}_\kappa$ consisting of perfect trees of height $\lambda$ and width $\kappa$ where $\kappa$ is a singular $\omega$-strong limit of cofinality $\lambda$. They showed that if $\kappa$…

Consider $(\kappa^{+++},\kappa^{++}) \twoheadrightarrow (\kappa^+,\kappa)$ where $\kappa$ is an uncountable regular cardinal. By a result of Shelah's we have $\operatorname{cof}(X \cap \kappa^{++}) = \kappa$ for almost all $X \subset…

We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…

In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…