Hostname: page-component-89b8bd64d-46n74 Total loading time: 0 Render date: 2026-05-10T22:37:02.756Z Has data issue: false hasContentIssue false

SUBCOMPACT CARDINALS, TYPE OMISSION, AND LADDER SYSTEMS

Published online by Cambridge University Press:  04 February 2022

YAIR HAYUT
Affiliation:
EINSTEIN INSTITUTE OF MATHEMATICS THE HEBREW UNIVERSITY OF JERUSALEM EDMOND J. SAFRA CAMPUS, GIVAT RAM, JERUSALEM 9190401, ISRAEL E-mail: yair.hayut@mail.huji.ac.at E-mail: mensara@savion.huji.ac.il
MENACHEM MAGIDOR
Affiliation:
EINSTEIN INSTITUTE OF MATHEMATICS THE HEBREW UNIVERSITY OF JERUSALEM EDMOND J. SAFRA CAMPUS, GIVAT RAM, JERUSALEM 9190401, ISRAEL E-mail: yair.hayut@mail.huji.ac.at E-mail: mensara@savion.huji.ac.il
Rights & Permissions [Opens in a new window]

Abstract

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

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic