首页/论文/math/9201243

arXiv math/92012431992-01math.LO

The Hanf numbers of stationary logic. II. Comparison with other logics

Saharon Shelah

发表信息：: Notre Dame J. Formal Logic 33 (1992), 1--12

英文摘要：

We show that the ordering of the Hanf number of L_{omega, omega}(wo) (well ordering), L^c_{omega, omega} (quantification on countable sets), L_{omega, omega}(aa) (stationary logic) and second order logic, have no more restraints provable in ZFC than previously known (those independence proofs assume CON(ZFC) only). We also get results on corresponding logics for L_{lambda, mu} .

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Hanf Number for Scott Sentences of Computable Structures

The Hanf number for a set $S$ of sentences in $L_{ω_1,ω}$ (or some other logic) is the least infinite cardinal $κ$ such that for all $φ\in S$, if $φ$ has models in all infinite cardinalities less than $κ$, then it has models of all infinite cardinalities. S-D. Friedman asked what is the Hanf number for Scott sentences of computable structures. We show that the value is $\beth_{ω_1^{CK}}$. The same argument proves that $\beth_{ω_1^{CK}}$ is the Hanf number for Scott sentences of hyperarithmetical structures.

2016-11-01math.LO

抽象逻辑的上向Löwenheim-Skolem-Tarski数

Upward Löwenheim-Skolem-Tarski Numbers for Abstract Logics

该论文研究抽象逻辑的上向Löwenheim-Skolem-Tarski数，证明二阶逻辑的ULST数是最小可扩展基数，并引入强ULST数及新大基数概念刻画多种强逻辑。

2024-04-18math.LO

Quillen Model Structures-Based Notions of Locality of Logics over Finite Models

Locality is a property of logics, based on Hanf's and Gaifman's theorems, and that was shown to be very useful in the context of finite model theory. In this paper I present a homotopic variation for locality, namely a Quillen model category-based framework for locality under k-logical equivalence, for every primitive-positive sentence of quantifier-rank k.

2020-05-18math.CTmath.LO

局部与全局 d-刚性在图的一阶逻辑中不可定义

Local and global $d$-rigidity are not definable in the first order logic of graphs

本文借助 Hanf 局部性和 k-电路图全局刚性结果，证明局部与全局 d-刚性无法在图的一阶逻辑中定义。

2025-11-07math.COmath.LO

The $Π^1_1 \! \! \downarrow$ Löwenheim-Skolem-Tarski property of Stationary Logic

Fuchino-Maschio-Sakai~\cite{FuchinoEtAl_DRP_LST} proved that the Löwenheim-Skolem-Tarski (LST) property of Stationary Logic is equivalent to the Diagonal Reflection Principle on internally club sets ($\text{DRP}_{\text{IC}}$) introduced in \cite{DRP}. We prove that the restriction of the LST property to (downward) reflection of $Π^1_1$ formulas, which we call the $Π^1_1 \! \! \downarrow$-LST property, is equivalent to the \emph{internal} version of DRP from \cite{Cox_RP_IS}. Combined with results from \cite{Cox_RP_IS}, this shows that the $Π^1_1 \! \! \downarrow$-LST Property for Stationary Lo…

2020-03-28math.LO

Strong downward Löwenheim-Skolem theorems for stationary logics, II -- reflection down to the continuum

Continuing the previous paper, we study the Strong Downward Löwenheim-Skolem Theorems (SDLSs) of the stationary logic and their variations. It has been shown that the SDLS for the ordinary stationary logic with weak second-order parameters down to $<\aleph_2$ is equivalent to the conjunction of CH and Cox's Diagonal Reflection Principle for internally clubness. We show that the SDLS for the stationary logic without weak second-order parameters down to $<2^{\aleph_0}$ implies that the size of the continuum is $\aleph_2$. In contrast, an internal interpretation of the stationary logic can satisf…

2020-09-07math.LO

更多相关论文收起更多论文

Strong downward Löwenheim-Skolem theorems for stationary logics, III -- mixed support iteration

Continuing [Fuchino, Ottenbreit and Sakai[9, 10]] and [Fuchino and Ottenbreit[11]], we further study reflection principles in connection with the Löwenheim-Skolem Theorems of stationary logics. In this paper, we mainly analyze the situations in the models obtained by mixed support iteration of a supercompact length and then collapsing another supercompact cardinal to make it $(2^{\aleph_0})^+$. We show, among other things, that the reflection down to $< 2^{\aleph_0}$ of the non-metrizability of topological spaces with small character is independent from the reflection properties studied in [Fu…

2021-07-06math.LO

迭代的俱乐部射击与稳定逻辑可构造模型

Iterated club shooting and the stationary-logic constructible model

Hebrew University of Jerusalem（耶路撒冷希伯来大学）；University of Helsinki（赫尔辛基大学）

本文通过迭代构造稳定逻辑模型$ C(\mathtt{aa}) $，探讨了在通用扩展下如何获得$ V=C(\mathtt{aa}) $的模型，并引入互肥集以提升不可数迭代的分布性结果。

2026-03-09math.LO

$Σ_1$-Stationary logic 作为 $\aleph_1$-Abstract Elementary Class

$Σ_1$-Stationary logic as an $\aleph_1$-Abstract Elementary Class

本文研究了$Σ_1$-Stationary逻辑作为$\aleph_1$-Abstract Elementary Class的性质，通过展示仅使用$aa$量词的逻辑框架扩展了抽象初等类的范围。

2026-04-28math.LO

Defining long words succinctly in FO and MSO

We consider the length of the longest word definable in FO and MSO via a formula of size n. For both logics we obtain as an upper bound for this number an exponential tower of height linear in n. We prove this by counting types with respect to a fixed quantifier rank. As lower bounds we obtain for both FO and MSO an exponential tower of height in the order of a rational power of n. We show these lower bounds by giving concrete formulas defining word representations of levels of the cumulative hierarchy of sets. In addition, we consider the Löwenheim-Skolem and Hanf numbers of these logics on w…

2022-02-21cs.LOmath.LO

Stationary sets and infinitary logic

Let K^0_lambda be the class of structures < lambda,<,A>, where A subseteq lambda is disjoint from a club, and let K^1_lambda be the class of structures < lambda,<,A>, where A subseteq lambda contains a club. We prove that if lambda = lambda^{< kappa} is regular, then no sentence of L_{lambda^+ kappa} separates K^0_lambda and K^1_lambda. On the other hand, we prove that if lambda = mu^+, mu = mu^{< mu}, and a forcing axiom holds (and aleph_1^L= aleph_1 if mu = aleph_0), then there is a sentence of L_{lambda lambda} which separates K^0_lambda and K^1_lambda .

1997-06-15math.LO