Related papers: Universality properties of forcing
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…
We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…
We study the strength of well-founded ultrafilters on ordinals above choiceless large cardinals and their associated Prikry forcings. Gabriel Goldberg showed that all but boundedly many regular cardinals above a rank Berkeley cardinal carry…
We investigate the use of models from the theory of regularity structures as features in machine learning tasks. A model is a polynomial function of a space-time signal designed to well-approximate solutions to partial differential…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We review and extend existing frameworks on modeling to develop a new framework that describes model-based reasoning in upper-division physics labs. Constructing and using models are core scientific practices that have gained significant…
The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…
The peculiar velocities of galaxies are driven by gravity, and hence hold the promise of probing details of how gravity forms structures. In particular it is possible to constrain cosmological parameters and to test extensions to the…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
In these notes we present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications: the Friedman-Mitchell poset for adding a club in \omega_2 with finite conditions,…
For models of concurrent and distributed systems, it is important and also challenging to establish correctness in terms of safety and/or liveness properties. Theories of distributed systems consider equivalences fundamental, since they (1)…
In physics, there is the prevailing intuition that we are part of a unique external world, and that the goal of physics is to understand and describe this world. This assumption of the fundamentality of objective reality is often seen as a…
Let $A$ be an infinite set. Let $\Omega(A)$ be the algebra over $A$ where every constant is a fundamental constant and every finitary function is a fundamental operation. We shall give a method of representing any algebra $\mathcal{L}$ in…
We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…
We consider the possibility of a past and future eternal universe, constructing geodesically complete inflating, loitering, and bouncing spacetimes. We identify the constraints energy conditions in General Relativity place on the building…
Identifying small subsets of features that are relevant for prediction and/or classification tasks is a central problem in machine learning and statistics. The feature selection task is especially important, and computationally difficult,…
We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of…
We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…
We study the structure of the Rudin-Frolik order on countably complete ultrafilters under the assumption that this order is directed. This assumption, called the Ultrapower Axiom, holds in all known canonical inner models. It turns out that…