English
Related papers

Related papers: $^*$Forcing

200 papers

We investigate the generalized derivations and show that every generalized derivation on a simple Hilbert $C^*$-module either is closable or has a dense range. We also describe dynamical systems on a full Hilbert $C^*$-module ${\mathcal M}$…

Operator Algebras · Mathematics 2021-07-23 Gh. Abbaspour , M. S. Moslehian , A. Niknam

We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-L\"of random set X such that X does not compute 0' and X computes every K-trivial set.

Logic · Mathematics 2013-04-11 Adam R. Day , Joseph S. Miller

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…

Logic · Mathematics 2010-03-16 Fredrik Engström

Let $X$ be a normal complex projective variety, $T\subseteq X$ a subvariety, $a\colon X\rightarrow A$ a morphism to an abelian variety such that $\rm{Pic}^0(A)$ injects into $\rm{Pic}^0(T)$ and let $L$ be a line bundle on $X$. Denote by…

Algebraic Geometry · Mathematics 2020-10-28 Miguel Ángel Barja , Rita Pardini , Lidia Stoppino

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.

Logic · Mathematics 2007-12-13 Peter M. Johnson

Assume that $M$ is a c.t.m. of $ZFC+CH$ containing a simplified $(\omega_1,2)$-morass, $P\in M$ is the poset adding $\aleph_3$ generic reals and $G$ is $P$-generic over $M$. In $M$ we construct a function between sets of terms in the…

Logic · Mathematics 2019-05-27 Bob A. Dumas

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

Logic · Mathematics 2015-08-18 Borisa Kuzeljevic , Stevo Todorcevic

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

Logic · Mathematics 2009-09-25 Ralf Schindler

We note that some form of the condition "$p_1, p_2$ have a $\leq_{\mathbb{Q}}$-lub in $\mathbb{Q}$" is necessary in some forcing axiom for $\lambda$-complete $\mu^+$-c.c. forcing notions. We also show some versions are really stronger than…

Logic · Mathematics 2020-07-30 Saharon Shelah

We study the relationship between Amoeba forcing (the partial order which generically adds a measure one set of random reals) and projective measurability. Given a universe V of set theory and a forcing notion P in V we say that V is…

Logic · Mathematics 2009-09-25 Jörg Brendle

We present a detailed general framework to describe the forcing $\tilde{\mathbb{E}}$, defined by Kellner, Shelah and Tan\u{a}sie to prove the consistency with ZFC of an alternative order of Cicho\'n's maximum. Our presentation is close to…

Logic · Mathematics 2024-02-08 Diego A. Mejía

We consider inductive systems of C*-algebras with completely positive contractive connecting maps. We define a condition, called C*-encoding, which is sufficient for the limit of the system to be completely order isomorphic to a C*-algebra…

Operator Algebras · Mathematics 2023-06-26 Kristin Courtney

We extend A. Miller's framework of $\alpha$-forcing to the case of a regular uncountable cardinal $\kappa = \kappa^{<\kappa}$ and apply it to study the structure of the $\kappa$-Borel hierarchy on subspaces of the generalized Baire space…

Logic · Mathematics 2026-03-10 Nick Chapman

It is well known that the completeness theorem for $\mathrm{L}_{\omega_1\omega}$ fails with respect to Tarski semantics. Mansfield showed that it holds for $\mathrm{L}_{\infty\infty}$ if one replaces Tarski semantics with boolean valued…

Logic · Mathematics 2023-05-16 Juan M. Santiago , Matteo Viale

We answer a question of Moore by building a forcing extension satisfying measuring together with CH. The construction works over any model of ZFC and can be described as a forcing iteration with countable structures as side conditions and…

Logic · Mathematics 2011-11-14 David Asperó , Miguel Angel Mota

We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

We introduce the notion of a totally ($K$-) bounded element of a W*-probability space $(M, \varphi)$ and, borrowing ideas of Kadison, give an intrinsic characterization of the $^*$-subalgebra $M_{tb}$ of totally bounded elements. Namely, we…

Operator Algebras · Mathematics 2025-01-27 Jananan Arulseelan , Isaac Goldbring , Bradd Hart , Thomas Sinclair

The purpose of this note is to describe when a general complex algebraic $^*$-algebra is pre-$C^*$-normed, and to investigate their structure when the $^*$-algebras are Baer $^*$-rings in addition to algebraicity. As a main result we prove…

Operator Algebras · Mathematics 2022-04-20 Zsolt Szűcs , Balázs Takács

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

Logic · Mathematics 2016-09-07 Carsten Butz , Ieke Moerdijk
‹ Prev 1 4 5 6 7 8 10 Next ›