Related papers: Descriptive set theory and forcing; How to prove t…
Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable…
We describe a connection between the combinatorics of generators for certain groups and the combinatorics of Helly's 1913 theorem on convex sets. We use this connection to prove fixed point theorems for actions of these groups on…
We show that for $\Pi_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal…
In (Borceux-Janelidze 2001) they prove a Categorical Galois Theorem for ordinary categories, and establish the main result of (Joyal-Tierney 1984), along with the classical Galois theory of Rings, as instances of this more general result.…
The theorem we prove is a slight strengthening of some results by Just, Miller, Scheepers and Szeptycki [JMSS]. We use the Michael technique instead of the combinatorial approach in the literature. Comments by the submitter: This short…
Forcing was first introduced by Paul J. Cohen in his work on the independence of the Continuum Hypothesis. Other formulations of forcing appeared using Model Theory, Boolean-valued Models, and Topos Theory. There is a folkloric claim that…
We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and transfinite-order arithmetic, extending the…
The foundations of forcing theory are reworked to streamline the presentation and to show how the most basic results are applicable in very general contexts.
In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…
We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three relativised non-lowness classes that are the…
The purpose of this book is to lay out certain aspects of descriptive set theory. After initially establishing notation and generalities we proceed to the following topics: partitions, semirings, rings, $\sigma$-rings, $\delta$-rings,…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
We analyse the Boolean-valued random forcing $B_{M,\Omega}$ in bounded arithmetics developed in Krajicek (Forcing with random variables and proof complexity, vol. 382, Cambridge University Press, 2011) from the perspective of the forcing in…
The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…
Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…
In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…
With every $\sigma$-ideal $I$ on a Polish space we associate the $\sigma$-ideal $I^*$ generated by the closed sets in $I$. We study the forcing notions of Borel sets modulo the respective $\sigma$-ideals $I$ and $I^*$ and find connections…
We develop Descriptive Set Theory in Generalized Baire Spaces without assuming $\kappa^{<\kappa}=\kappa$. We point out that without this assumption the basic topological concepts of these spaces have to be slightly modified in order to…
The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…