English
Related papers

Related papers: On equivalence relations Sigma_1^1-definable over …

200 papers

In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…

Logic · Mathematics 2019-07-23 John Krueger

We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopenka's principle. We prove that the necessary large-cardinal…

Category Theory · Mathematics 2012-12-04 Joan Bagaria , Carles Casacuberta , A. R. D. Mathias , Jiri Rosicky

We consider natural $\Sigma^1_2$ definable analogues of many of the classical statements that have been shown to be equivalent to CH. It is shown that these $\Sigma^1_2$ analogues are equivalent to that all reals are constructible. We also…

Logic · Mathematics 2012-11-27 Asger Tornquist , William Weiss

We prove that the strong polarized relation of $\theta$ above $\omega$ applied simultaneously for every cardinal in the interval $[\aleph_1,\aleph]$ is consistent. We conclude that this positive relation is consistent for every cardinal…

Logic · Mathematics 2018-04-24 Shimon Garti , Saharon Shelah

We prove under $V=L$ that the inclusion modulo the non-stationary ideal is a $\Sigma_1^1$-complete quasi-order in the generalized Borel-reducibility hierarchy ($\kappa>\omega$). This improvement to known results in $L$ has many new…

Logic · Mathematics 2019-12-10 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…

Logic · Mathematics 2022-10-18 Saharon Shelah

We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if $\kappa \leq \lambda$, then $$\sup_{|A| = \lambda} |S^\kappa(A)| =…

Logic · Mathematics 2017-02-22 Will Boney

The bounded proper forcing axiom BPFA is the statement that for any family of aleph_1 many maximal antichains of a proper forcing notion, each of size aleph_1, there is a directed set meeting all these antichains. A regular cardinal kappa…

Logic · Mathematics 2016-09-06 Martin Goldstern , Saharon Shelah

We argue that we solved Hilbert's first problem positively (after reformulating it just to avoid the known consistency results) and give some applications. Let lambda to the revised power of kappa, denoted lambda^{[kappa]}, be the minimal…

Logic · Mathematics 2016-09-07 Saharon Shelah

Through careful analysis of an argument of Brooke-Taylor and Rosicky, we show that the powerful image of any accessible functor is closed under colimits of $\kappa$-chains, $\kappa$ a sufficiently large almost measurable cardinal. This…

Logic · Mathematics 2019-12-17 Michael Lieberman

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

Logic · Mathematics 2016-09-07 Saharon Shelah

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let {\sf BC}$_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture.…

Logic · Mathematics 2012-07-06 Fred Galvin , Marion Scheepers

Based on the class of epsilon numbers, another binary relational <^1 in the ordinals is introduced. We will see that we can easily describe all the isomorphisms that are witnesses of <^1. Afterwards we will show that the isomorphisms…

Logic · Mathematics 2013-09-20 Parménides García Cornejo

It is a common knowledge that the integer functions definable in simply typed lambda-calculus are exactly the extended polynomials. This is indeed the case when one interprets integers over the type (p->p)->p->p where p is a base type…

Logic in Computer Science · Computer Science 2007-05-23 Mateusz Zakrzewski

Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa…

Logic · Mathematics 2007-05-23 Saharon Shelah , Masahiro Shioya

The Kalikow problem for a pair (lambda, kappa) of cardinal numbers, lambda > kappa (in particular kappa =2) is whether we can map the family of omega --sequences from lambda to the family of omega --sequences from kappa in a very continuous…

Logic · Mathematics 2016-09-07 Saharon Shelah

For an uncountable regular cardinal \kappa we let \nabla_\kappa(A) be the statement that A \subset \kappa and for all regular \theta > \kappa, the set of all X \in [\theta]^<\kappa such that X \cap \kappa \in \kappa and otp(X \cap OR) is a…

Logic · Mathematics 2007-05-23 Ralf Schindler

We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly $\theta$-supercompact, for any desired $\theta$. In addition, we prove several global results…

Logic · Mathematics 2013-05-28 Brent Cody , Moti Gitik , Joel David Hamkins , Jason Schanker

We show that the tree property, stationary reflection and the failure of approachability at $\kappa^{++}$ are consistent with $\mathfrak{u}(\kappa) = \kappa^+ < 2^\kappa$, where $\kappa$ is a singular strong limit cardinal with the…

Logic · Mathematics 2019-11-01 Radek Honzik , Sarka Stejskalova

For a cardinal of the form $\kappa=\beth_\kappa$, Shelah's logic $L^1_\kappa$ has a characterisation as the maximal logic above $\bigcup_{\lambda<\kappa} L_{\lambda, \omega}$ satisfying Strong Undefinability of Well Order (SUDWO). SUDWO is…

Logic · Mathematics 2021-07-22 Mirna Džamonja , Jouko Väänänen