Related papers: $^*$Forcing

We give topological characterizations of filters $F$ on $w$ such that the Mathias forcing $M_F$ adds no dominating reals or preserves ground model unbounded families. This allows us to answer some questions of Brendle, Guzm\'an,…

Given an essential ideal $J\subset A$ of a C*-algebra $A$, and a Hilbert C*-module $M$ over $A$, we place $M$ between two other Hilbert C*-modules over $A$, $M_J\subset M\subset M^J$, in such a way that each submodule here is thick, i.e.…

We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an ''intensional'' or ''effective'' view of respectively ill-and well-foundedness properties to an…

We prove rigidity results for large classes of corona algebras, assuming the Proper Forcing Axiom. In particular, we prove that a conjecture of Coskey and Farah holds for all separable $C^*$-algebras with the metric approximation property…

In this note, we promote an infinite Kadison transitivity theorem on massive $C^*$-algebras, including the Calkin algebra. This transitivity stems from the analog of countable degree-1 saturation on pure states which is inherited from these…

With every $\sigma$-ideal $I$ on a Polish space we associate the $\sigma$-ideal $I^*$ generated by the closed sets in $I$. We study the forcing notions of Borel sets modulo the respective $\sigma$-ideals $I$ and $I^*$ and find connections…

We study (von Neumann) regular $^*$-subalgebras of $B(H)$, which we call R$^*$-algebras. The class of R$^*$-algebras coincides with that of "E$^*$-algebras that are pre-C$^*$-algebras" in the sense of Z. Sz\H{u}cs and B. Tak\'acs. We give…

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well} quasi-orders, under the construction $P\mapsto P^{<\omega}$…

Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…

Using families of curves to generalize vector fields, the Lie bracket is defined on a metric space, M. For M complete, versions of the local and global Frobenius theorems hold, and flows are shown to commute if and only if their bracket is…

The notion of an $\mathcal{M}$-coextensive object is introduced in an arbitrary category $\mathbb{C}$, where $\mathcal{M}$ is a distinguished class of morphisms from $\mathbb{C}$. This notion allows for a categorical treatment of the strict…

In this contribution we investigate several extensions of the powerset that comprise arbitrarily nested subsets, and call them superpower set. This allows the definition of graphs with possibly infinitely nested nodes. additionally we…

It is consistent (relative to ZFC) that the union of max{b,g} many families in the Baire space which are not finitely dominating is not dominating. In particular, it is consistent that for each nonprincipal ultrafilter U, the cofinality of…

We prove that if $\bI$ is a p.\ o. set in a countable transitive model $\gM$ of $\ZFC$ then $\gM$ can be extended by a generic sequence of reals $\a_\i,$ $\i\in\bI,$ such that $\aleph_1^\gM$ is preserved and every $\a_\i$ is Sacks generic…

Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…

To a Boolean inverse monoid $S$ we associate a universal C*-algebra $C_B^*(S)$ and show that it is equal to Exel's tight C*-algebra of $S$. We then show that any invariant mean on $S$ (in the sense of Kudryavtseva, Lawson, Lenz and Resende)…

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

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…

Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time $O(|G||w|^{3 - \myeps})$ on a grammar $G$ and a string $w$ can be used to multiply $m \times m$ Boolean…