中文
相关论文

相关论文: The core model for almost linear iterations

200 篇论文

In [Sh:89] we, answering a question of Monk, have explicated the notion of ``a Boolean algebra with no endomorphisms except the ones induced by ultrafilters on it'' (see section 2 here) and proved the existence of one with character density…

逻辑 · 数学 2008-02-03 Saharon Shelah

Fairly deep results of Zermelo-Frenkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is K*K = K,…

计算机科学中的逻辑 · 计算机科学 2016-08-31 Lawrence C. Paulson , Krzysztof Grabczewski

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…

逻辑 · 数学 2014-06-17 Asaf Karagila

Let $Z_3$ denote $3^{rd}$ order arithmetic. Let Harrington's Principle, HP, denote the statement that there is a real $x$ such that every $x$--admissible ordinal is a cardinal in $L$. In this paper, assuming there exists a remarkable…

逻辑 · 数学 2025-10-02 Yong Cheng

We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…

组合数学 · 数学 2022-01-28 John T. Baldwin

We introduce a model-theoretic characterization of Magidor cardinals, from which we infer that Magidor filters are beyond ZFC-inconsistency

逻辑 · 数学 2017-06-30 Shimon Garti , Yair Hayut , Saharon Shelah

Harvey Friedman, in his remarkable paper Finite functions and the necessary use of large cardinals, Ann. Math. 148:803-893, 1998 and in a technical report, Applications of large cardinals to graph theory, Ohio State University, 1997,…

组合数学 · 数学 2019-09-17 S. Gill Williamson

We study the parameterized complexity of the T(h+1)-Free Edge Deletion problem. Given a graph G and integers k and h, the task is to delete at most k edges so that every connected component of the resulting graph has size at most h. The…

数据结构与算法 · 计算机科学 2026-02-04 Ajinkya Gaikwad , Soumen Maity , Leeja R

Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…

逻辑 · 数学 2018-03-09 Vera Fischer , Daniel T. Soukup

For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…

逻辑 · 数学 2026-05-14 Mohammad Golshani , Grigorii Stepanov , Reihane Zoghifard

We will prove that there exists a model of ZFC+``c= omega_2'' in which every M subseteq R of cardinality less than continuum c is meager, and such that for every X subseteq R of cardinality c there exists a continuous function f:R-> R with…

逻辑 · 数学 2016-09-07 Krzysztof Ciesielski , Saharon Shelah

We study the Diophantine equation $a^5+b^5=c^5+d^5$ under the linear slicing constraint $(c+d)-(a+b)=h$. We first prove the necessary congruence $30\mid h$. After symmetrization, the associated discriminant equation defines, for each fixed…

数论 · 数学 2026-03-17 Valery Asiryan

We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by $Loc({\rm ZFC})$, says that every set belongs to a transitive model of ZFC. LZFC consists of $Loc({\rm ZFC})$ plus…

逻辑 · 数学 2023-03-28 Athanassios Tzouvaras

Answering questions of A. Avil\'es, F. Cabello S\'anchez, J. Castillo, M. Gonz\'alez and Y. Moreno we show that the following statements are independent of the usual axioms ZFC with arbitrarily large continuum: for every (some)…

泛函分析 · 数学 2025-12-10 Piotr Koszmider , Małgorzata Rojek

Let K be an abstract elementary class of models. Assume that there are less than the maximal number of models in K_{\lambda^{+n}} (namely models in K of power \lambda^{+n}) for all n. We provide conditions on K_\lambda, that imply the…

逻辑 · 数学 2010-01-17 Adi Jarden , Saharon Shelah

We develop a Borel-de Siebenthal theory for affine reflection systems by classifying their maximal closed subroot systems. Affine reflection systems (introduced by Loos and Neher) provide a unifying framework for root systems of…

环与代数 · 数学 2022-09-20 Deniz Kus , R. Venkatesh

We construct a Borel graph G such that ZF+DC+"There are no maximal independent sets in G" is equiconsistent with ZFC+"There exists an inaccessible cardinal".

逻辑 · 数学 2019-09-02 Haim Horowitz , Saharon Shelah

This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a principle that is expected to hold in Woodin's…

逻辑 · 数学 2020-07-10 Gabriel Goldberg

This paper explores several topics related to Woodin's HOD conjecture. We improve the large cardinal hypothesis of Woodin's HOD dichotomy theorem from an extendible cardinal to a strongly compact cardinal. We show that assuming there is a…

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

Let $K$ be a Birch field, that is, a field for which every diagonal form of odd degree in sufficiently many variables admits a non-zero solution; for example, $K$ could be the field of rational numbers. Let $f_1, \ldots, f_r$ be homogeneous…

数论 · 数学 2024-06-27 Amichai Lampert , Andrew Snowden