English
Related papers

Related papers: Template iterations with non-definable ccc forcing…

200 papers

The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M…

Logic · Mathematics 2012-05-07 Ioannis Souldatos

Hellsten \cite{MR2026390} proved that when $\kappa$ is $\Pi^1_n$-indescribable, the \emph{$n$-club} subsets of $\kappa$ provide a filter base for the $\Pi^1_n$-indescribability ideal, and hence can also be used to give a characterization of…

Logic · Mathematics 2020-01-31 Brent Cody , Victoria Gitman , Chris Lambie-Hanson

We prove a compactness theorem for pseudopower operations of the form $pp_{\Gamma(\mu,\sigma)}(\mu)$ where $\aleph_0<\sigma=cf(\sigma)\leq cf(\mu)$. Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also…

Logic · Mathematics 2019-06-25 Todd Eisworth

We prove that if there are $\mathfrak c$ incomparable selective ultrafilters then, for every infinite cardinal $\kappa$ such that $\kappa^\omega=\kappa$, there exists a group topology on the free Abelian group of cardinality $\kappa$…

Logic · Mathematics 2021-03-25 M. K. Bellini , K. P. Hart , V. O. Rodrigues , A. H. Tomita

This article continues Ros{\l}anowski and Shelah math.LO/9906024, math.LO/0508272, math.LO/0210205, math.LO/0611131 and math.LO/0605067. We introduce here a new property of <lambda-strategically complete forcing notions which implies that…

Logic · Mathematics 2013-08-20 Andrzej Roslanowski , Saharon Shelah

Usuba has asked whether the $\kappa$-mantle, the intersection of all grounds that extend to $V$ via a forcing of size ${<}\kappa$, is always a model of ZFC. We give a negative answers by constructing counterexamples where $\kappa$ is a…

Logic · Mathematics 2024-03-15 Andreas Lietz

Shelah showed that the existence of free subsets over internally approachable subalgebras follows from the failure of the PCF conjecture on intervals of regular cardinals. We show that a stronger property called the Approachable Bounded…

Logic · Mathematics 2021-02-01 Dominik Adolf , Omer Ben-Neria

The primary goal of this paper is to establish a model of $ZFC$ wherein the definable tree property is affirmed for all uncountable regular cardinals. This endeavor commences with the utilization of both a supercompact cardinal and a…

Logic · Mathematics 2023-10-10 Mohammad Golshani , Mostafa Mirabi

We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

Jech proved that every partially ordered set can be embedded into the cardinals of some model of $ZF$. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $ZF+DC_{<\kappa}$ for…

Logic · Mathematics 2014-06-17 Asaf Karagila

We show that, assuming GCH, if $\kappa$ is a Ramsey or a strongly Ramsey cardinal and $F$ is a class function on the regular cardinals having a closure point at $\kappa$ and obeying the constraints of Easton's theorem, namely,…

Logic · Mathematics 2012-09-07 Brent Cody , Victoria Gitman

We give some general criteria, when kappa-complete forcing preserves largeness properties -- like kappa-presaturation of normal ideals on lambda (even when they concentrate on small cofinalities). Then we quite accurately obtain the…

Logic · Mathematics 2016-09-06 Moti Gitik , Saharon Shelah

We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…

Logic in Computer Science · Computer Science 2018-11-28 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

For $\kappa$ regular and uncountable we define variants of the classical cardinal characteristics modulo the non-stationary ideal.

Logic · Mathematics 2021-05-18 Johannes Philipp Schürz

In this paper, we deal with the notions of naturality from category theory and definablity from model theory and their interactions. In this regard, we present three results. First, we show, under some mild conditions, that naturality…

Logic · Mathematics 2025-10-02 Mohsen Asgharzadeh , Mohammad Golshani , Saharon Shelah

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

Assuming the negation of Chang's conjecture, there is a c.c.c. forcing which adds a strongly non-saturated Aronszajn tree. Using a Mahlo cardinal, we construct a model in which there exists a strongly non-saturated Aronszajn tree and the…

Logic · Mathematics 2025-06-30 John Krueger , Šárka Stejskalová

We consider compactness characterizations of large cardinals. Based on results of Benda \cite{b-sccomp}, we study compactness for omitting types in various logics. In $\bL_{\kappa, \kappa}$, this allows us to characterize any large cardinal…

Logic · Mathematics 2019-03-19 Will Boney

For each natural number $n$, let $C^{(n)}$ be the closed and unbounded proper class of ordinals $\alpha$ such that $V_\alpha$ is a $\Sigma_n$ elementary substructure of $V$. We say that $\kappa$ is a \emph{$C^{(n)}$-cardinal} if it is the…

Logic · Mathematics 2019-08-27 Joan Bagaria

Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…

Logic · Mathematics 2012-08-14 M. Malliaris , S. Shelah