中文
相关论文

相关论文: Inaccessibility and Subinaccessibility. In two par…

200 篇论文

We provide a model theoretical and tree property like characterization of $\lambda$-$\Pi^1_1$-subcompactness and supercompactness. We explore the behaviour of those combinatorial principles at accessible cardinals.

逻辑 · 数学 2022-02-03 Yair Hayut , Menachem Magidor

We prove, via transfinite recursion, the existence, inside any linearly ordered set of appropriate regular cardinality $\lambda$, of a particular kind of well-ordered subsets characterized by the property of $\lambda$-fullness. Let $H$ be a…

逻辑 · 数学 2024-03-26 Gabriele Gullà

$\Sigma^1_3$-absoluteness for ccc forcing means that for any ccc forcing $P$, ${H_{\omega_1}}^V \prec_{\Sigma_2}{H_{\omega_1}}^{V^P}$. "$\omega_1$ inaccessible to reals" means that for any real $r$, ${\omega_1}^{L[r]}<\omega_1$. To measure…

逻辑 · 数学 2022-09-20 David Schrittesser

We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection…

逻辑 · 数学 2022-10-14 Brent Cody

We introduce the notion of weakly extendible cardinals and show that these cardinals are characterized in terms of weak compactness of second order logic. The consistency strength and largeness of weakly extendible cardinals are located…

逻辑 · 数学 2023-01-06 Sakaé Fuchino , Hiroshi Sakai

Recently it has been proved that, assuming that there is an almost disjoint family of cardinality (2^{\mathfrak c}) in (\mathfrak c) (which is assured, for instance, by either Martin's Axiom, or CH, or even $2^{<\mathfrak c=\mathfrak c$})…

泛函分析 · 数学 2012-07-13 Jose Luis Gamez-Merino , Juan B. Seoane-Sepulveda

A cardinal is weakly Reinhardt if it is the critical point of an elementary embedding from the universe of sets into a model that contains the double powerset of every ordinal. This note establishes the equiconsistency of a proper class of…

逻辑 · 数学 2021-07-29 Gabriel Goldberg

We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…

范畴论 · 数学 2020-01-08 Sebastien Vasey

The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.

计算复杂性 · 计算机科学 2007-05-23 Harry Buhrman , Tao Jiang , Ming Li , Paul Vitanyi

Miller's 1937 splitting theorem was proved for pairs of cardinals $(\n,\rho)$ in which $n$ is finite and $\rho$ is infinite. An extension of Miller's theorem is proved here in ZFC for pairs of cardinals $(\nu,\rho)$ in which $\nu$ is…

组合数学 · 数学 2013-05-17 Menachem Kojman

We show that generalized eventually narrow sequences on a strongly inaccessible cardinal $\kappa$ are preserved under the Cummings-Shaleh non-linear iterations of the higher Hechler forcing on $\kappa$. Moreover assuming GCH,…

逻辑 · 数学 2020-05-25 Ömer Faruk Bağ , Vera Fischer

We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…

逻辑 · 数学 2012-02-28 Andrew D. Brooke-Taylor

This dissertation includes many theorems which show how to change large cardinal properties with forcing. I consider in detail the degrees of inaccessible cardinals (an analogue of the classical degrees of Mahlo cardinals) and provide new…

逻辑 · 数学 2015-06-15 Erin Carmody

A detailed and rigorous analysis of G\"odel's proof of his first incompleteness theorem is presented. The purpose of this analysis is two-fold. The first is to reveal what G\"odel actually proved to provide a clear and solid foundation upon…

逻辑 · 数学 2020-04-30 Jason W. Steinmetz

In this paper the claim that Zeno's paradoxes have been solved is contested. Although no one has ever touched Zeno without refuting him (Whitehead), it will be our aim to show that, whatever it was that was refuted, it was certainly not…

历史与综述 · 数学 2023-04-11 Karin Verelst

The main result of this paper is an improvement of the upper bound on the cardinal invariant ${\mathord{\mathrm{cov}}}^{\ast}({\mathcal{Z}}_{0})$ that was discovered by Raghavan and Shelah in an earlier paper. Here ${\mathcal{Z}}_{0}$ is…

逻辑 · 数学 2017-12-12 Dilip Raghavan

An important classical result in ZFC asserts that every infinite cardinal number is idempotent. Using this fact, we obtain several algebraic results in this article. The first result asserts that an infinite Abelian group has a proper…

交换代数 · 数学 2024-09-05 Abolfazl Tarizadeh

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…

逻辑 · 数学 2023-10-10 Mohammad Golshani , Mostafa Mirabi

We show that any directed colimit of acessible categories and accessible full embeddings is accessible and, assuming the existence of arbitrarily large strongly compact cardinals, any directed colimit of acessible categories and accessible…

范畴论 · 数学 2013-09-17 R. Pare , J. Rosicky

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem: Suppose $\kappa$ is a singular strong limit cardinal and…

逻辑 · 数学 2016-09-06 Moti Gitik , William Mitchell