On Cns(κ) and the Juhász–Kunen Question

We generalize the combinatorial principles Cn(κ), Cns(κ), and Princ(κ) introduced by various authors, and prove some of their properties and connections between them. We also answer a question asked by Juhász and Kunen about the relation between these principles, by showing that Cn(κ) does not imply Cn+1(κ) for any n>2. We also show the consistency of C(κ)+¬Cs(κ).

Authors

Institutions

Publication Details

Journal
Notre Dame Journal of Formal Logic
Published
2024-11-01
DOI
https://doi.org/10.1215/00294527-2024-0026
Primary Topic
History and Theory of Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Cns(κ) and the Juhász–Kunen Question

Saharon Shelah, Mohammad Amin Golshani
Notre Dame Journal of Formal Logic
History and Theory of Mathematics
article

On Cns(κ) and the Juhász–Kunen Question

Saharon Shelah, Mohammad Amin Golshani
article en

Abstract

We generalize the combinatorial principles Cn(κ), Cns(κ), and Princ(κ) introduced by various authors, and prove some of their properties and connections between them. We also answer a question asked by Juhász and Kunen about the relation between these principles, by showing that Cn(κ) does not imply Cn+1(κ) for any n>2. We also show the consistency of C(κ)+¬Cs(κ).

Notre Dame Journal of Formal LogicVol. 65(4)
Rutgers, The State University of New Jersey (US), Hebrew University of Jerusalem (IL), Institute for Research in Fundamental Sciences (IR)
Openalex Percentile: Top 75%
History and Theory of Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.