Related papers: $^*$Forcing

We introduce weakenings of two of the more prominent open problems in the classification of $\mathrm{C}^*$-algebras, namely the quasidiagonality problem and the UCT problem. We show that the a positive solution of the conjunction of the two…

We consider the algebra $\mathcal O(\mathsf M)$ of observables and the (formally) versal morphism $\eta: A \to \mathcal O(\mathsf M)$ defined by the noncommutative deformation functor $\mathsf{Def}_{\mathsf M}$ of a family $\mathsf M = \{…

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…

In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…

Costello and Gwilliam have given both 1) a general definition of perturbative quantum gauge theory on a manifold M and 2) a construction of a factorization algebra of quantum observables assigned to every quantum gauge theory. In this…

The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…

Theorem: Let $n\ge 2.$ There is a CCC in $L$ forcing notion $P=P_n\in L$ such that $P$-generic extensions of $L$ are of the form $L[a],$ where $a\subseteq\omega$ and 1) $a$ is $\Delta^1_{n+1}$ in $L[a]$; and 2) if $b\in L[a],$…

We adapt the classical notion of building models by games to the setting of continuous model theory. As an application, we study to what extent canonical operator algebras are enforceable models. For example, we show that the hyperfinite…

The forcing number of a perfect matching $M$ in a graph $G$ is the smallest number of edges inside $M$ that can not be contained in other perfect matchings. The anti-forcing number of $M$ is the smallest number of edges outside $M$ whose…

A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…

Let I be a sigma-ideal sigma-generated by a projective collection of closed sets. The forcing with I-positive Borel sets is proper and adds a single real r of an almost minimal degree: if s is a real in V[r] then s is Cohen generic over V…

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

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,…

In this note we include two remarks about bounded ($\underline{not}$ necessarily contractive) linear projections on a von Neumann-algebra. We show that if $M$ is a von Neumann-subalgebra of $B(H)$ which is complemented in B(H) and…

Fix a set-theoretic universe $V$. We look at small extensions of $V$ as generalised degrees of computability over $V$. We also formalise and investigate the complexity of certain methods one can use to define, in $V$, subclasses of degrees…

Using a finite support iteration of ccc forcings, we construct a model of $\aleph_1<\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{b}<\mathrm{non}(\mathcal{M})<\mathrm{cov}(\mathcal{M})=\mathfrak{c}$.

We introduce $\ell$-leaky positive semidefinite forcing and the $\ell$-leaky positive semidefinite number of a graph, $Z_{(\ell)}^+{G}$, which combines the positive semidefinite color change rule with the addition of leaks to the graph.…

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…

In Mathias forcing, conditions are pairs $(D,S)$ of sets of natural numbers, in which $D$ is finite, $S$ is infinite, and $\max D < \min S$. The Turing degrees and computational characteristics of generics for this forcing in the special…

Let $\mathcal{A}$ and $\mathcal{B}$ be two algebras, let $\mathcal{M}$ be a $\mathcal{B}$-bimodule and let $n$ be a positive integer. A linear mapping $D_n:\mathcal{A} \rightarrow \mathcal{M}$ is called a strongly generalized derivation of…