Related papers: Sheva-Sheva-Sheva: Large Creatures
Based on works of Saharon Shelah, Jakob Kellner, and Anda T\u{a}nasie for controlling the cardinal characteristics of the continuum in ccc forcing extensions, in the author's master's thesis was introduced a new combinatorial notion: the…
We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…
This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…
Let $\Lambda$ be a Legendrian in the jet space of some manifold $X$. To a generating family presentation of $\Lambda$, we associate a constructible sheaf on $X \times \mathbb{R}$ whose singular support at infinity is $\Lambda$, and such…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…
I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…
Cosmological models involving shear and rotation are considered, first in the General Relat ivistic and then in the Newtonian framework with the aim of investigating singularities in them by using numerical and analytical techniques. The…
The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…
This paper finally fully elaborates the tree pulldown method used by one of us (Harrington) to settle McLaughlin's conjecture. This method enables the construction of a computable tree $T_0$ whose paths are incomparable over $0^{(\alpha)}$…
We continue our study of maps transforming high-dimensional complicated objects into squares of stationary sets. Previously, we proved that many such transformations exist in ZFC, and here we address the consistency of the strongest…
By using sheaf-theoretical methods such as constructible sheaves, we generalize the formula of Libgober-Sperber concerning the zeta functions of monodromy at infinity of polynomial maps into various directions. In particular, some formulas…
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results…
This book provides an inviting tour through sheaf theory, from the perspective of applied category theory and pitched at a less specialized audience than is typical with introductions to sheaves. The book makes it as easy as possible for…
We define the notion of a sheaf over a complex of groups. As an application, we give a criterion for the developability of a complex of groups. When the developability is witnessed by a morphism to $\mathrm{GL}(V)$ for some $V$, our…
We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…
We show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…
The lace expansion is a powerful perturbative technique to analyze the critical behavior of random spatial processes such as the self-avoiding walk, percolation and lattice trees and animals. The non-backtracking lace expansion (NoBLE) is a…
In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the…