Related papers: $^*$Forcing
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
We give a modification of Mitchell's technique for adding objects of size $\omega_2$ with conditions with finite working parts in which the collections of models used as side conditions are very highly structured, arguably making them more…
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…
Based on the work done in \cite{BV-Tind,DMS} in the o-minimal and geometric settings, we study expansions of models of a supersimple theory with a new predicate distiguishing a set of forking-independent elements that is dense inside a…
Extending Mart\'in Escard\'o's effectful forcing technique, we give a new proof of a well-known result: Brouwer's monotone bar theorem holds for any bar that can be realized by a functional of type $(\mathbb{N} \to \mathbb{N}) \to…
This is a contribution to the problem of classifying all deformations - a. k. a. liftings - of the bosonization of a Nichols algebra $\mathfrak{B}(V)$ over a cosemisimple and non-semisimple Hopf algebra $H$. Such a situation arises when the…
Every partial algebra is the colimit of its total subalgebras. We prove this result for partial Boolean algebras (including orthomodular lattices) and the new notion of partial C*-algebras (including noncommutative C*-algebras), and…
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…
We produce a forcing extension of the constructible universe $\bL$ in which every universally measurable set of reals is $\uTDelta^{1}_{2}$, partially answering question CG from David Fremlin's problem list. The analogous result for…
We apply a general approach for distributions of binary isolating and semi-isolating formulas to the class of strongly minimal theories.
This paper investigates factorial $W^*$-bundles and their ultraproducts. More precisely, a $W^*$-bundle is factorial if the von Neumann algebras associated to its fibers are all factors. Let $M$ be the tracial ultraproduct of a family of…
Let $Z_3$ denote $3^{rd}$ order arithmetic. Let Harrington's Principle, HP, denote the statement that there is a real $x$ such that every $x$--admissible ordinal is a cardinal in $L$. In this paper, assuming there exists a remarkable…
In this short note, we will show the following weak evidence of S. Lang conjecture over function fields. Let f : X ---> Y be a projective and surjective morphism of algebraic varieties over an algebraically closed field k of characteristic…
We classify extensions of certain classifiable C*-algebras using the six term exact sequence in K-theory together with the positive cone of the K_0-groups of the distinguished ideal and quotient. We then apply our results to a class of…
Let $\Omega\subset\mathbb{R}^n$ be an open, connected subset of $\mathbb{R}^n$, and let $F\colon\Omega-\Omega\to\mathbb{C}$, where $\Omega-\Omega=\{x-y\colon x,y\in\Omega\}$, be a continuous positive definite function. We give necessary and…
A transitive model $M$ of ZFC is called a ground if the universe $V$ is a set forcing extension of $M$. We show that the grounds of $V$ are downward set-directed. Consequently, we establish some fundamental theorems on the forcing method…
We study the question of when a given countable ordinal $\alpha$ is $\Sigma^1_n$- or $\Pi^1_n$-reflecting in models which are neither $\mathsf{PD}$ models nor the constructible universe, focusing on generic extensions of $L$. We prove,…
We show: There are pairs of universes V_1 subseteq V_2 and there is a notion of forcing P in V_1 such that the change mentioned in the title occurs when going from V_1[G] to V_2[G] for a P-generic filter G over V_2. We use forcing…
We define a $\sigma$-centered notion of forcing that forces the existence of a Boolean algebra with the Grothendieck property and without the Nikodym property. In particular the existence of such an algebra is consistent with the negation…
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).