Related papers: A general theory of iterated forcing using finitel…
We study the dimension theory of limit sets of iterated function systems consisting of a countably infinite number of contractions. Our primary focus is on the intermediate dimensions: a family of dimensions depending on a parameter $\theta…
We introduce a minimal ZFC-internal axiom system for pre-structural data (X, A, mu, mu^{otimes 2}, R, I, Pi_R, G, E_0, eta), where Pi_R : X -> R is a designated map and G subset X x X is a measurable relation; admissible structural models…
A finite family $\mathrsfs{F}$ of subsets of a finite set $X$ is union-closed whenever $f,g\in\mathrsfs{F}$ implies $f\cup g\in\mathrsfs{F}$. These families are well known because of Frankl's conjecture. In this paper we developed further…
The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such…
We introduce a new method for building models of CH, together with $\Pi_2$ statements over $H(\omega_2)$, by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only $\aleph_1$-many of…
We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…
By using nonstandard analysis, and in particular iterated hyper-extensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for…
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along…
Shelah shows that certain revised countable support (RCS) iterations do not add reals. His motivation is to establish the independence (relative to large cardinals) of Avraham's problem on the existence of uncountable non-constuctible…
We introduce Gowers--Matet forcing with a finite sequence of pairwise non-isomorphic Ramsey ultrafilters over $\omega$, and with this forcing we settle the long-standing problem of the spectrum of numbers near-coherence classes. We prove…
We investigate how set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for information about a model of set theory $\langle M,\in^M\rangle$, we explain senses in which one may compute…
The study of generalized iterated function systems (GIFS) was introduced by Mihail and Miculescu in 2008. We provide a new approach to study those systems as the limit of the Hutchinson-Barnsley setting for infinite iterated function…
A classical theorem of Hutchinson asserts that if an iterated function system acts on $\mathbb{R}^d$ by similitudes and satisfies the open set condition then it admits a unique self-similar measure with Hausdorff dimension equal to the…
This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…
In a self-contained way, we deal with revised countable support iterated forcing for the reals. We improve theorems on preservation of the property UP, weaker than semi proper, and we hopefully improve the presentation. We continue [Sh:b,…
In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…
In this paper, we explore various ways in which a factor $\sigma$-algebra $\mathscr{B}$ can sit in a dynamical system $\mathbf{X} :=(X, \mathscr{A}, \mu, T)$, i.e. we study some possible structures of the extension $\mathscr{A} \rightarrow…
In chapter 9 of his book "The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal", Woodin shows how to force the Strong Chang Conjecture over models of determinacy using $\mathbb{P}_{\mathrm{max}}$. We show here how a…
Gleason's theorem [A. Gleason, J. Math. Mech., \textbf{6}, 885 (1957)] is an important result in the foundations of quantum mechanics, where it justifies the Born rule as a mathematical consequence of the quantum formalism. Formally, it…
Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…