English
Related papers

Related papers: On a Conjecture Regarding the Mouse Order for Weas…

200 papers

Assume GCH and let $\lambda$ denote an uncountable cardinal. We prove that if $\square_\lambda$ holds, then this may be witnessed by a coherent sequence $< C_\alpha | \alpha < \lambda^+ >$ with the following remarkable guessing property:…

Logic · Mathematics 2011-05-17 Assaf Rinot

We continue the work of [KlSh:362] and prove that for lambda successor, a lambda-categorical theory T in L_{kappa^*, omega} is mu-categorical for every mu, mu <= lambda which is above the (2^{LS(T)})^+-beth cardinal.

Logic · Mathematics 2009-09-25 Saharon Shelah

Let K be an Abstract Elemenetary Class satisfying the amalgamation and the joint embedding property, let \mu be the Hanf number of K. Suppose K is tame. MAIN COROLLARY: (ZFC) If K is categorical in a successor cardinal bigger than…

Logic · Mathematics 2007-05-23 Rami Grossberg , Monica VanDieren

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 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

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

Logic · Mathematics 2023-10-31 Miloš S. Kurilić

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of…

Logic · Mathematics 2025-09-17 Juan P. Aguilera , Joan Bagaria , Philipp Lücke

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

Logic · Mathematics 2020-03-23 Matteo Viale

We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…

Logic · Mathematics 2026-05-05 Radek Honzik

We study the $\kappa$-Borel-reducibility of isomorphism relations of complete first order theories by using coloured trees. Under some cardinality assumptions, we show the following: For all theories T and T', if T is classifiable and T' is…

Logic · Mathematics 2025-02-05 Miguel Moreno

We prove a revised version of Laver's indestructibility theorem which slightly improves over the classical result. An application yields the consistency of $(\kappa^+,\kappa)\notcc(\aleph\_1,\aleph\_0)$ when $\kappa$ is supercompact. The…

Logic · Mathematics 2007-05-23 Bernhard Koenig

This paper continues the study of the Ramsey-like large cardinals. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such…

Logic · Mathematics 2011-04-25 Victoria Gitman , Philip Welch

We introduce a hierarchy of models of the Axiom of Determinacy called \emph{Nairian models}. Forcing over the simplest Nairian model, we obtain a model of ${\sf{ZFC}}+{\sf{MM^{++}}}(c)+\neg\square_{\omega_3}+\neg\square(\omega_3)$. Then,…

Logic · Mathematics 2025-02-03 Douglas Blue , Paul B. Larson , Grigor Sargsyan

One of the most frustrating problems faced by set theorists working with iterated proper forcing is the lack of techniques for producing models in which the continuum has size greater than the second uncountable cardinal. In this paper we…

Logic · Mathematics 2012-08-20 David Asperó , Miguel Angel Mota

We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…

Logic · Mathematics 2015-06-23 Diego Alejandro Mejía

We show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…

Logic · Mathematics 2025-04-14 Heike Mildenberger , Saharon Shelah

All spaces below are $T_0$ and crowded (i.e. have no isolated points). For $n \le \omega$ let $M(n)$ be the statement that there are $n$ measurable cardinals and $\Pi(n)$ ($\Pi^+(n)$) that there are $n+1$ (0-dimensional $T_2$) spaces whose…

General Topology · Mathematics 2022-05-31 István Juhász , Lajos Soukup , Zoltán Szentmiklóssy

Let GCH hold and let $j:V\longrightarrow M$ be a definable elementary embedding such that $crit(j)=\kappa$, $^{\kappa}M\subseteq M$ and $\kappa^{++}=\kappa_{M}^{++}$. H. Woodin proved that there is a cofinality preserving generic extension…

Logic · Mathematics 2017-06-27 Yoav Ben Shalom

The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…

Computational Complexity · Computer Science 2018-07-20 Ralph C. Bottesch

A classic conjecture of F\"{u}redi, Kahn and Seymour (1993) states that given any hypergraph with non-negative edge weights $w(e)$, there exists a matching $M$ such that $\sum_{e \in M} (|e|-1+1/|e|)\, w(e) \geq w^*$, where $w^*$ is the…

Combinatorics · Mathematics 2023-10-13 Nikhil Bansal , David G. Harris
‹ Prev 1 3 4 5 6 7 10 Next ›