Related papers: Forcing axioms, approachability, and stationary se…
We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…
Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded…
In light of the Suita conjecture, we explore various rigidity phenomena concerning the Bergman kernel, logarithmic capacity, Green's function, and Euclidean distance and volume.
We search for viable f(R) theories of gravity, making use of the equivalence between such theories and scalar-tensor gravity. We find that models can be made consistent with solar system constraints either by giving the scalar a high mass…
In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…
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…
Given a tracial von Neumann algebra $(M,\tau)$, we prove that a state preserving $M$-bimodular ucp map between two stationary W$^*$-extensions of $(M,\tau)$ preserves the Furstenberg entropy if and only if it induces an isomorphism between…
We show that the compositeness condition for the induced gauge boson in the four-fermion interaction theory actually works beyond the one-loop approximation. The next-to-leading contributions are calculated, and turn out to be reasonably…
We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have simple universal strongly generic conditions on a stationary set of…
We give another bit of evidence that forcing axioms provide proper framework for rigidity of quotient structures, by improving the OCA lifting theorem proved by the author in late 20th century and greatly simplifying its proof. In the…
We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…
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.…
Shelah considered a certain version of Strong Chang's Conjecture, which we denote $\text{SCC}^{\text{cof}}$, and proved that it is equivalent to several statements, including the assertion that Namba forcing is semiproper. We introduce an…
We investigate the relationship between weak square principles and simultaneous reflection of stationary sets.
This note describes Fatou's lemma and Lebesgue's dominated convergence theorem for a sequence of measures converging weakly to a finite measure and for a sequence of functions whose negative parts are uniformly integrable with respect to…
We investigate the interaction between compactness principles and guessing principles in the Radin forcing extensions. In particular, we show that in any Radin forcing extension with respect to a measure sequence on $\kappa$, if $\kappa$ is…
Given a $p$-adic group $G$ equipped with an action of a finite group $\Gamma\subset\mathrm{Aut}_F(\mathbf{G})$, and a reductive fixed-point subgroup $G^\Gamma$, we establish a relationship between constructions of types for these two groups…
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 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 develop a linear systems theory that coincides with the existing theories for continuous and discrete dynamical systems, but that also extends to linear systems defined on nonuniform time domains. The approach here is based on…