English
Related papers

Related papers: Extender-based Magidor-Radin forcings without top …

200 papers

Given a positive integer $n$, an $n$-ladder is a lower finite lattice whose elements have at most $n$ lower covers. In 1984, Ditor proved that every $n$-ladder has cardinality at most $\aleph_{n-1}$ and asked whether this bound is sharp,…

Combinatorics · Mathematics 2026-04-08 Lorenzo Notaro

Let $D$ be an infinite discrete set of measurable cardinals. It is shown that generalized Prikry forcing to add a countable sequence to each cardinal in $D$ is subcomplete. To do this it is shown that a simplified version of generalized…

Logic · Mathematics 2018-12-31 Kaethe Minden

We study the notion of tightly stationary sets which was introduced by Foreman and Magidor in \cite{ForMag-MS}. We obtain two consistency results which show that it is possible for a sequence of regular cardinals $( \kappa_n )_{n < \omega}$…

Logic · Mathematics 2017-10-10 Omer Ben-Neria

We revisit several results concerning club principles and nonsaturation of the nonstationary ideal, attempting to improve them in various ways. So we typically deal with a (non necessarily normal) ideal $J$ extending the nonstationary ideal…

Logic · Mathematics 2019-08-16 Pierre Matet

We consider the cardinal sequences of compact scattered spaces in models where CH is false. We describe a number of models where the continuum is aleph_2 in which no such space can have aleph_2 countable levels.

General Topology · Mathematics 2007-05-23 Kenneth Kunen

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…

Logic · Mathematics 2019-08-15 Chris Lambie-Hanson , Assaf Rinot

Let $G$ be a graph of order $n$. A classical upper bound for the domination number of a graph $G$ having no isolated vertices is $\lfloor\frac{n}{2}\rfloor$. However, for several families of graphs, we have $\gamma(G) \le…

Combinatorics · Mathematics 2025-12-09 Subramanian Arumugam , Suresh Manjanath Hegde , Shashanka Kulamarva

In this article we apply the machinery developed in Guo-Iyer[1] together with a new compactness estimate and an object called the degree in order to prove validity of steady Prandtl layer expansions with external forcing.

Analysis of PDEs · Mathematics 2018-10-17 Yan Guo , Sameer Iyer

We prove that a large class of presaturated ideals at inaccessible cardinals can be de-saturated while preserving their presaturation, answering both a question of Foreman and of Cox and Eskew. We do so by iterating a generalized version of…

Logic · Mathematics 2021-04-21 Noah Schoem

Two are the main objectives of this article: first, we introduce a method for determining and analyzing constrained local extrema that provides a different alternative to all previous works on the topic, by eliminating Lagrange multipliers…

Classical Analysis and ODEs · Mathematics 2013-03-14 Salvador Gigena

We calculate the Casimir interaction between two short range scatterers embedded in a background of one dimensional massless Dirac fermions using a force operator approach. We obtain the force between two finite width square barriers, and…

Mesoscale and Nanoscale Physics · Physics 2009-11-13 Dina Zhabinskaya , Jesse M. Kinder , E. J. Mele

This paper is the concise addition to the foregoing work "Inconsistency of Inaccessibility", containing the presentation of main theorem proof (in ZF) about inaccessible cardinals nonexistence. Here some refinement of this presentation is…

Logic · Mathematics 2011-10-21 A. Kiselev

We give two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular and at least equal to aleph_3, while the second is a negative consistency result which applies to…

Logic · Mathematics 2007-05-23 Mirna Džamonja , Saharon Shelah

We define a version of Gitik-Sharon diagonal Prikry forcing using a strongly compact cardinal, and prove its basic properties.

Logic · Mathematics 2019-12-19 Mohammad Golshani

It is a consequence of the axiom of choice that every preorder can be extended to a total preorder while respecting the strict preorder relation. We call such an extension a prelinearization of the preorder and study the extent to which the…

Logic · Mathematics 2026-02-17 Azul Fatalini , Luke Serafin

We prove upper bounds on outside probabilities for generic non-autonomous Schr\"odinger operators on lattices of arbitrary dimension. Our approach is based on a combination of commutator method originated in scattering theory and novel…

Mathematical Physics · Physics 2024-10-01 Jingxuan Zhang

In this paper we give sufficient conditions for a Pontryagin extremal trajectory, consisting of two bang arcs followed by a singular one, to be a strong local minimizer for a Mayer problem. The problem is defined on a manifold $M$ and the…

Optimization and Control · Mathematics 2016-08-09 Laura Poggiolini , Gianna Stefani

Using a variation of Woodin's $\mathbb{P}_{\mathrm{max}}$ forcing, we force over a model of the Axiom of Determinacy to produce a model of ZFC containing a very strongly increasing sequence of length $\omega_{2}$ consisting of functions…

Logic · Mathematics 2026-04-01 Paul B. Larson , Chris Lambie-Hanson

In this paper, we introduce several classes of Prikry-type forcing notions, two of which are used to produce minimal generic extensions, and the third is applied in $\alpha$-recursion theory to produce minimal covers. The first forcing as a…

Logic · Mathematics 2013-10-04 Yang Sen

The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a…

Logic · Mathematics 2016-07-05 Joel David Hamkins