Related papers: Sufficient conditions for the forcing theorem, and…
I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma$: the hierarchy of bounded forcing axioms, of $\Sigma^1_1$-absoluteness and of Aronszajn tree preservation principles. The latter…
We study the necessary and sufficient conditions on Abelianizable first class constraints. The necessary condition is derived from topological considerations on the structure of gauge group. The sufficient condition is obtained by applying…
In order to build the collection of Cauchy reals as a set in constructive set theory, the only Power Set-like principle needed is Exponentiation. In contrast, the proof that the Dedekind reals form a set has seemed to require more than…
Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and Forcing Theory in 2016, the author gave three tutorials on Ramsey theory in forcing. The first two tutorials concentrated on…
It is useful to have a criterion for when the predictions of an operational theory should be considered classically explainable. Here we take the criterion to be that the theory admits of a generalized-noncontextual ontological model.…
We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…
Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $\sigma$. There is a natural way to expand Forbh(F)…
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…
We describe a simple criterion for showing that a group has Serre's property FA. By exhibiting a certain pattern of finite subgroups, we show that this criterion is satisfied by Aut(F_n) and SL(n,Z) when n>=3.
Consider a set represented by an inequality. An interesting phenomenon which occurs in various settings in mathematics is that the interior of this set is the subset where strict inequality holds, the boundary is the subset where equality…
In model-driven development, an ordered model transformation is a nested set of transformations between source and target classes, in which each transformation is governed by its own pre and post- conditions, but structurally dependent on…
In this paper we show that forcings which are strongly proper for stationarily many countable elementary submodels preserve each of the following properties of topological spaces: countably tight; Lindel\"of; Rothberger; Menger; and a…
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.
We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…
Although Zermelo-Fraenkel set theory (ZFC) is generally accepted as the appropriate foundation for modern mathematics, proof theorists have known for decades that virtually all mainstream mathematics can actually be formalized in much…
In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…
The goal of this paper is to study Goldbach's conjecture for rings of regular functions of affine algebraic varieties over a field. Among our main results, we define the notion of Goldbach condition for Newton polytopes, and we prove in a…
I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot…
We investigate forcing properties of perfect tree forcings defined by Prikry to answer a question of Solovay in the late 1960's regarding first failures of distributivity. Given a strictly increasing sequence of regular cardinals $\langle…
We explain and explore class-theoretic potentialism -- the view that one can always individuate more classes over a set-theoretic universe. We examine some motivations for class-theoretic potentialism, before proving some results concerning…