Related papers: Descriptive set theory and forcing; How to prove t…
The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…
This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…
In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…
The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…
A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…
This expository paper, aimed at the reader without much background in set theory or logic, gives an overview of Cohen's proof (via forcing) of the independence of the continuum hypothesis. It emphasizes the broad outlines and the intuitive…
The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…
We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…
We consider a class of second order ordinary differential equations describing one-dimensional systems with a quasi-periodic analytic forcing term and in the presence of damping. As a physical application one can think of a…
The paper is a naive introduction to descriptive set theory. It is aimed mathematicians without a background in logic. The goal is to provide the basic facts used for applications of descriptive set theory to other areas of mathematics,…
Twenty years have passed since Kechris' seminal survey paper [A. S. Kechris, New directions in descriptive set theory. Bull. Symbolic Logic, 5(2):161-174, 1999]. As a follow-up of that work, we review some ot the (anti-)classification…
This dissertation aims to provide a comprehensive account of set theory with urelements. In Chapter 1, I present mathematical and philosophical motivations for studying urelement set theory and lay out the necessary technical preliminaries.…
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
The paper tries to extend results of the classical Descriptive Set Theory to as many countably based T_0-spaces (cb_0-spaces) as possible. Along with extending some central facts about Borel, Luzin and Hausdorff hierarchies of sets we…
We comment on a recent paper that connects certain forms of machine learning to Set Theory. We point out that part of the set-theoretic machinery is related to a result of Kuratowski about decompositions of finite powers of sets and we show…
Descriptive set theory was originally developed on Polish spaces. It was later extended to $\omega$-continuous domains [Selivanov 2004] and recently to quasi-Polish spaces [de Brecht 2013]. All these spaces are countably-based. Extending…
The purpose of this article is to give a presentation of the method of forcing aimed at someone with a minimal knowledge of set theory and logic. The emphasis will be on how the method can be used to prove theorems in ZFC.
We extend A. Miller's framework of $\alpha$-forcing to the case of a regular uncountable cardinal $\kappa = \kappa^{<\kappa}$ and apply it to study the structure of the $\kappa$-Borel hierarchy on subspaces of the generalized Baire space…