中文
相关论文

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

200 篇论文

We develop a version of Cichon's diagram for cardinal invariants on the generalized Cantor space 2^kappa or the generalized Baire space kappa^kappa where kappa is an uncountable regular cardinal. For strongly inaccessible kappa, many of the…

In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish…

逻辑 · 数学 2022-02-22 Assaf Rinot , Jing Zhang

We prove that every finite lattice L can be embedded in a three-generated finite lattice K. We also prove that every algebraic lattice with accessible cardinality is a complete sublattice of an appropriate algebraic lattice K such that K is…

环与代数 · 数学 2015-12-15 Gábor Czédli

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…

逻辑 · 数学 2019-01-18 P. D. Welch

We prove that consistently there is a singular cardinal $\kappa$ of uncountable cofinality such that $2^\kappa$ is weakly inaccessible, and every regular cardinal strictly between $\kappa$ and $2^\kappa$ is the character of some uniform…

逻辑 · 数学 2019-07-30 James Cummings , Charles Morgan

Justin Moore's weak club-guessing principle $\mho$ admits various possible generalizations to the second uncountable cardinal. One of them was shown to hold in ZFC by Shelah. A stronger one was shown to follow from several consequences of…

逻辑 · 数学 2024-07-29 Ido Feldman

We produce a model where every supercompact cardinal is $C^{(1)}$-supercompact with inaccessible targets. This is a significant improvement of the main identity-crises configuration obtained in \cite{HMP} and provides a definitive answer to…

逻辑 · 数学 2024-06-19 Alejandro Poveda

This is the second part of a small-scale explorative study in an effort to assess reproducibility issues specific to scientometrics research. This effort is motivated by the desire to generate empirical data to inform debates about…

数字图书馆 · 计算机科学 2018-04-16 Theresa Velden , Sybille Hinze , Andrea Scharnhorst , Jesper Wiborg Schneider , Ludo Waltman

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…

逻辑 · 数学 2026-05-05 Radek Honzik

The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…

逻辑 · 数学 2013-07-24 Moti Gitik , Saharon Shelah

Effectively inseparable pairs and their properties play an important role in the meta-mathematics of arithmetic and incompleteness. Different notions are introduced and shown in the literature to be equivalent to effective inseparability.…

逻辑 · 数学 2025-06-17 Yong Cheng

We develop a 2-dimensional version of accessibility and presentability compatible with the formalism of flat pseudofunctors. First we give prerequisites on the different notions of 2-dimensional colimits, filteredness and cofinality; in…

范畴论 · 数学 2025-08-05 Ivan Di Liberti , Axel Osmond

In this article, we give a proof for that the cardinality of a function basis of the invariants for a finite dimensional real vector space by a compact group is lower bounded by the intuitive difference of the dimensions of the vector space…

代数几何 · 数学 2018-08-06 Shenglong Hu , Liqun Qi

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

计算复杂性 · 计算机科学 2019-04-30 Thomas Colcombet , Joël Ouaknine , Pavel Semukhin , James Worrell

Let PCP(k) denote the Post Correspondence Problem for k input pairs of strings. Let ACCESSIBILITY(k) denote the the word problem for k-rule semi-Thue systems. In 1980, Claus showed that if ACCESSIBILITY(k) is undecidable then PCP(k + 4) is…

离散数学 · 计算机科学 2008-11-12 Francois Nicolas

We prove a result concerning elementary embeddings of the set-theoretic universe into itself (Reinhardt embeddings) and functions on ordinals that "eventually dominate" such embeddings. We apply that result to show the existence of…

逻辑 · 数学 2025-05-02 Marwan Salam Mohammd

In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article we did not give proofs, and instead asserted that we have…

组合数学 · 数学 2014-01-28 Neil Robertson , Daniel P. Sanders , Paul Seymour , Robin Thomas

In the first part of the manuscript, we establish several consistency results concerning Woodin's $\HOD$ hypothesis and large cardinals around the level of extendibility. First, we prove that the first extendible cardinal can be the first…

逻辑 · 数学 2024-11-07 Gabriel Goldberg , Jonathan Osinski , Alejandro Poveda

An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…

逻辑 · 数学 2012-05-21 Laura Fontanella

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…

逻辑 · 数学 2013-05-28 Brent Cody , Moti Gitik , Joel David Hamkins , Jason Schanker