English
Related papers

Related papers: New consequences of PFA($T^*$)

200 papers

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

Logic · Mathematics 2023-06-22 Natasha Dobrinen , Daniel Hathaway

We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…

Logic in Computer Science · Computer Science 2025-04-08 Vera Koponen , Yasmin Tousinejad

In the Zermelo--Fraenkel set theory with the Axiom of Choice a forcing notion is "$\kappa$-distributive" if and only if it is "$\kappa$-sequential". We show that without the Axiom of Choice this equivalence fails, even if we include a weak…

Logic · Mathematics 2022-12-22 Asaf Karagila , Jonathan Schilhan

Generalizing the proof for Sacks forcing, we show that the $h$-perfect tree forcing notions introduced by Goldstern, Judah and Shelah preserve selective independent families even when iterated. As a result we obtain new proofs of the…

Logic · Mathematics 2022-02-25 Corey Bacal Switzer

Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…

Formal Languages and Automata Theory · Computer Science 2026-05-12 Shaull Almagor , Michaël Cadilhac , Asaf Shoham

We study a general Kishimoto's problem for automorphisms on simple C*-algebras with tracial rank zero. Let $A$ be a unital separable simple C*-algebra with tracial rank zero and let $\alpha$ be an automorphism. Under the assumption that…

Operator Algebras · Mathematics 2010-01-28 Huaxin Lin

Let G be a finite abelian group of torsion r and let A be a subset of G. The Freiman--Ruzsa theorem asserts that if |A+A| < K|A| then A is contained in a coset of a subgroup of G of size at most r^{K^4}K^2|A|. It was conjectured by Ruzsa…

Combinatorics · Mathematics 2018-06-07 Chaim Even-Zohar , Shachar Lovett

Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[\kappa]$, from which we confirm that $\kappa$-Souslin trees exist in various models of interest. As a corollary…

Logic · Mathematics 2021-04-20 Assaf Rinot

Tree tensor network descriptions of critical quantum spin chains are empirically known to reproduce correlation functions matching CFT predictions in the continuum limit. It is natural to seek a more complete correspondence, additionally…

Quantum Physics · Physics 2020-01-15 Alexander Kliesch , Robert Koenig

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

Logic · Mathematics 2024-05-17 Ben Goodman

We compute bounds and forecasts on screened modified gravity theories, specialising to the chameleon model in Casimir force experiments. In particular, we investigate the classical interaction between a plate and sphere subject to a…

General Relativity and Quantum Cosmology · Physics 2023-04-26 Philippe Brax , Anne-Christine Davis , Benjamin Elder

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

Logic · Mathematics 2018-02-15 Gunter Fuchs

In this paper we aim to compare Kurepa trees and Aronszajn trees. Moreover, we analyze the affect of large cardinal assumptions on this comparison. Using the the method of walks on ordinals, we will show it is consistent with ZFC that there…

Logic · Mathematics 2023-10-10 Hossein Lamei Ramandi , Stevo Todorcevic

The Kruskal-Friedman theorem asserts: in any infinite sequence of finite trees with ordinal labels, some tree can be embedded into a later one, by an embedding that respects a certain gap condition. This strengthening of the original…

Logic · Mathematics 2025-08-13 Anton Freund

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Logic · Mathematics 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah

We present an overview of the validity of the Proximity Force Approximation (PFA) in the calculation of Casimir forces between perfect conductors for different geometries, with particular emphasis for the configuration of a cylinder in…

Quantum Physics · Physics 2015-05-13 Francisco D. Mazzitelli , Fernando C. Lombardo , Paula I. Villar

The semiclassical limit of full non-commutative gauge theory is known as Poisson gauge theory. In this work we revise the construction of Poisson gauge theory paying attention to the geometric meaning of the structures involved and advance…

High Energy Physics - Theory · Physics 2022-11-30 V. G. Kupriyanov , M. A. Kurkov , P. Vitale

We discuss the constraints on the parameters of a Yukawa interaction obtained from the indirect measurements of the Casimir pressure between parallel plates using the sphere-plate configuration. Recently, it was claimed in the literature…

Quantum Physics · Physics 2010-07-20 E. Fischbach , G. L. Klimchitskaya , D. E. Krause , V. M. Mostepanenko

The electromagnetic Casimir interaction between two spheres is studied within the scattering approach using the plane-wave basis. It is demonstrated that the proximity force approximation (PFA) corresponds to the specular-reflection limit…

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…

Logic · Mathematics 2008-10-30 Bernhard Irrgang
‹ Prev 1 4 5 6 7 8 10 Next ›