English
Related papers

Related papers: Strong downward L\"owenheim-Skolem theorems for st…

200 papers

Continuing [Fuchino, Ottenbreit and Sakai[9, 10]] and [Fuchino and Ottenbreit[11]], we further study reflection principles in connection with the L\"owenheim-Skolem Theorems of stationary logics. In this paper, we mainly analyze the…

We study compactness and L\"owenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary…

Logic · Mathematics 2026-04-24 Jonathan Osinski , Trevor Wilson

Combining stationary reflection (a compactness property) with the failure of SCH (an instance of non-compactness) has been a long-standing theme. We obtain this at $\aleph_{\omega_1}$, answering a question of Ben-Neria, Hayut, and Unger: We…

Logic · Mathematics 2024-11-26 Tom Benhamou , Dima Sinapova

Bagaria and V\"a\"an\"anen developed a framework for studying the large cardinal strength of downwards L\"owenheim-Skolem theorems and related set theoretic reflection properties. The main tool was the notion of symbiosis, originally…

Logic · Mathematics 2020-07-30 Lorenzo Galeotti , Yurii Khomskii , Jouko Väänänen

Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…

Logic · Mathematics 2023-04-17 Saharon Shelah , Jouko Väänänen

Fuchino-Maschio-Sakai~\cite{FuchinoEtAl_DRP_LST} proved that the L\"owenheim-Skolem-Tarski (LST) property of Stationary Logic is equivalent to the Diagonal Reflection Principle on internally club sets ($\text{DRP}_{\text{IC}}$) introduced…

Logic · Mathematics 2020-03-31 Sean Cox

In this article we proved so-called strong reflection principles corresponding to formal theories Th which has omega-models. An posible generalization of the Lob's theorem is considered.Main results is: (1) let $k$ be an inaccessible…

General Mathematics · Mathematics 2019-10-08 Jaykov Foukzon

In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu$ such that the singular cardinal hypothesis fails at $\nu$ and every collection of fewer than $\mathrm{cf}(\nu)$…

Logic · Mathematics 2023-09-13 Omer Ben-Neria , Yair Hayut , Spencer Unger

Strong reflection principles with the reflection cardinal $\leq\aleph_1$ or $<2^{\aleph_0}$ imply that the size of the continuum is either $\aleph_1$ or $\aleph_2$ or very large. Thus, the stipulation, that a strong reflection principle…

Logic · Mathematics 2020-09-08 Sakaé Fuchino , André Ottenbreit Maschio Rodrigues

In this paper we continue the study in [Gilton-Levine-Stejskalova] of compactness and incompactness principles at double successors, focusing here on the case of double successors of singulars of countable cofinality. We obtain models which…

Logic · Mathematics 2024-08-13 Thomas Gilton , Šárka Stejskalová

In the setting of constructive reverse mathematics, we analyse the downward L\"owenheim-Skolem (DLS) theorem of first-order logic, stating that every infinite model has a countable elementary submodel. Refining the well-known equivalence of…

Logic in Computer Science · Computer Science 2026-01-21 Dominik Kirst , Haoyi Zeng

We study consequences of stationary and semi-stationary set reflection. We show that the semi stationary reflection principle implies the Singular Cardinal Hypothesis, the failure of weak square principle, etc. We also consider two cardinal…

Logic · Mathematics 2014-10-29 Hiroshi Sakai , Boban Velickovic

In this paper we investigate the consequences and consistency of the downward L\"owenheim-Skolem theorem for extension of the first order logic by the Magidor-Malitz quantifier. We derive some combinatorial results and improve the known…

Logic · Mathematics 2018-07-31 Yair Hayut

We introduce (super-$C^{(\infty)}$-)Laver-generic large cardinal axioms for extendibility ((super-$C^{(\infty)}$-)LgLCAs for extendible, for short), and show that most of the previously known consequences of the…

Logic · Mathematics 2025-06-26 Sakaé Fuchino

We examine the Zermelo Fraenkel set theory with Choice (ZFC) enhanced by one of the (structural) reflection principles down to a small cardinal and/or Recurrence Axioms defined below. The strongest forms of reflection principles spotlight…

Logic · Mathematics 2024-10-29 Sakaé Fuchino

We recently formulated a new large-cardinal axiom of strength intermediate between a totally indescribable cardinal and an $\omega$-Erd\H{o}s cardinal, positing the existence of what we called an "extremely reflective cardinal", and we…

Logic · Mathematics 2020-10-23 Rupert McCallum

Galeotti, Khomskii and V\"a\"an\"aanen recently introduced the notion of the upward L\"owenheim-Skolem-Tarski number for a logic, strengthening the classical notion of a Hanf number. A cardinal $\kappa$ is the \emph{upward…

Logic · Mathematics 2024-04-19 Victoria Gitman , Jonathan Osinski

It is widely claimed that the natural axiom systems$\unicode{x2013}$including the large cardinal axioms$\unicode{x2013}$form a well-ordered hierarchy. Yet, as is well-known, it is possible to exhibit non-linearity and ill-foundedness by…

Logic · Mathematics 2023-12-21 Hanul Jeon , James Walsh

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

Looped Language Models (LoopLMs) enable efficient latent reasoning through depth recurrence, yet exhibit unreliable test-time scaling behavior: performance often peaks at a certain iteration depth and then collapses with further recurrence.…

Machine Learning · Computer Science 2026-05-27 Xiao-Wen Yang , Ziyu Han , Xi-Hua Zhang , Wen-Da Wei , Jie-Jing Shao , Lan-Zhe Guo , Yu-Feng Li
‹ Prev 1 2 3 10 Next ›