REVIEW 2 major objections 3 minor 21 references
Weak compactness cardinals for strong logics and subtlety properties of the class of ordinals
T0 review · 2 major / 3 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read Weak compactness for every abstract logic is equivalent, over ZFC, to the scheme "Ord is essentially faint"; the scheme can hold without any strongly inaccessible cardinals, yet forces unboundedly many in HOD.
desk verdict Lücke proves the right ZFC characterizations and a sharp consistency contrast; the two suspicious steps in Theorem 1.14 and Corollary 4.5 are exposition gaps, not fatal flaws. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
Let $C(n)$ be the class of ordinals $\alpha$ with $V_\alpha$ a $\Sigma_n$-elementary substructure of $V$. The central combinatorial object is the class version of faintness: "Ord is essentially faint" says that for every definable class sequence $\langle E_\alpha\rangle$ with $\varnothing\neq E_\alpha\subseteq\mathcal{P}(\alpha)$, and every ordinal $\xi$, there are $\xi<\alpha<\beta$ and $A\in E_\beta$ with $A\cap\alpha\in E_\alpha$. The stronger scheme "Ord is essentially subtle" replaces the final "every ordinal $\xi$" by "every closed unbounded class $C$", requiring $\alpha<\beta$ both in $C$. Between these schemes and abstract logics stand the $C(n)$-weakly shrewd cardinals, defined by reflection of formulas to $\Sigma_n$-correct levels $H(\theta)$; Theorem 3.5 equates essential faintness with the existence of a proper class of such cardinals at every level $n$. On the model-theoretic side, Lemma 6.1 proves that every sufficiently large $C(n)$-weakly shrewd cardinal is a weak compactness cardinal for every abstract logic definable at level $n$, and Lemma 6.4 constructs inverse abstract logics that force any weak compactness cardinal to be $C(n)$-weakly shrewd. HOD enters through a lemma in which a $C(n)$-weakly shrewd cardinal that fails to be $C(n)$-strongly unfoldable produces a subtle cardinal in HOD.
What would settle it
A model of ZFC in which "Ord is essentially faint" holds but some explicitly defined abstract logic has no weak compactness cardinal would falsify Theorem 1.6; the theorem says no such model exists. For the HOD conclusion, a model in which "Ord is essentially subtle" holds in $V$ but not in HOD would falsify the transfer assumption used in the first case of the proof of Corollary 4.5.
Extended reading notes
Core claim
The central claim is Theorem 1.6: over ZFC, the scheme "Ord is essentially faint" is equivalent to the statement that every abstract logic has a weak compactness cardinal. Here a weak compactness cardinal for an abstract logic $L$ is a cardinal $\kappa$ such that every $L$-theory of size $\kappa$ all of whose subtheories of smaller size are satisfiable is itself satisfiable. The proof proceeds by a two-sided large-cardinal analysis: Section 3 shows that "Ord is essentially faint" is equivalent to the existence of a proper class of $C(n)$-weakly shrewd cardinals for every natural number $n$, and Section 6 shows that such cardinals are exactly the cardinals that can serve as weak compactness cardinals for definable abstract logics. A forcing argument then separates the scheme from strong inaccessibility: starting from a proper class of subtle cardinals, the paper produces a model with no strongly inaccessible cardinals in which a proper class of weakly shrewd cardinals survives, so that Ord is essentially faint (Theorem 1.14). Complementing this, Theorem 1.15 and Corollary 4.5 show that weak compactness for all logics forces unboundedly many ordinals to be strongly inaccessible in HOD, and in fact to be strongly inaccessible $C(n)$-weakly shrewd there.
Load-bearing premise
The load-bearing premise is that the scheme "Ord is essentially subtle" passes from the universe to the inner model HOD: the proof of Corollary 4.5 assumes that if the scheme holds in $V$, it also holds inside HOD, even though the club and witness sequences involved need not be ordinal-definable.
Editorial extensions
If this is right
- Over ZFC, "Ord is essentially faint" and "every abstract logic has a weak compactness cardinal" become two names for the same fact, settling the questions posed in the introduction without needing a definable well-ordering of the universe.
- Consistency of a proper class of subtle cardinals is equivalent to consistency of "Ord is essentially faint" together with the statement that there are no strongly inaccessible cardinals.
- Weak compactness for all abstract logics forces unboundedly many ordinals to be strongly inaccessible in HOD, and in fact to be strongly inaccessible $C(n)$-weakly shrewd cardinals there.
- Ordinal subtlety gives the model-theoretic companions: "Ord is essentially subtle" implies stationary classes of weak and strict Löwenheim–Skolem–Tarski numbers for every abstract logic, while "Ord is essentially faint" implies a strict Löwenheim–Skolem–Tarski number for every abstract logic.
- In any model of "Ord is essentially faint" in which only boundedly many cardinals are subtle in HOD, the stronger scheme "Ord is essentially subtle" must hold.
Reading between the lines
- A testable extension is to restrict the theorem to logics with a fixed occurrence number; the same bridge should yield bounded versions of essential faintness, producing a hierarchy between first-order compactness and full faintness for Ord.
- The forcing construction behind Theorem 1.14 suggests that "Ord is essentially faint" is compatible not only with the absence of inaccessible cardinals but also with a proper class of singular cardinals violating the Singular Cardinal Hypothesis, connecting the paper's Question 7.1 to cardinal arithmetic.
- Corollary 4.5 singles out an internal absoluteness question: whether "Ord is essentially subtle" passes from $V$ to HOD. A model where it fails would show Theorem 1.15 needs a different proof in that case, while a model where it holds would complete the first case of the corollary.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies weak compactness cardinals for all abstract logics and characterizes their existence through new combinatorial principles for the class of ordinals, 'Ord is essentially faint' and 'Ord is essentially subtle'. The main results are Theorem 1.6 (Ord is essentially faint iff every abstract logic has a weak compactness cardinal), Theorem 1.4 (the stationary version is equivalent to Ord being essentially subtle), Theorem 1.14 (an equiconsistency between a proper class of subtle cardinals and the failure of strongly inaccessible cardinals together with essential faintness), and Theorem 1.15 (essential faintness implies unboundedly many strongly inaccessible cardinals in HOD). The proofs use C(n)-weakly shrewd cardinals, forcing with Easton products, and coding arguments for abstract logics.
Significance. If the results are correct, they provide the first ZFC characterizations of weak compactness cardinals for arbitrary abstract logics, resolve a natural question raised by Boney–Dimopoulos–Gitman–Magidor, and sharply delimit the large-cardinal strength of the existence of such cardinals. The paper is careful and detailed, with full proofs of the main equivalences and explicit constructions of the relevant logics. Strong points include the parameter-free combinatorial formulations, the use of C(n)-weakly shrewd cardinals as a bridge between model-theoretic and set-theoretic properties, and the exact equiconsistency statements. The main reservations concern one load-bearing step in the consistency proof of Theorem 1.14 that is stated without sufficient justification.
major comments (2)
- [Section 4, proof of Theorem 1.14] The forward direction of Theorem 1.14 begins with the sentence 'Work in a model of ZFC+ V = L in which a proper class of subtle cardinals exists and no inaccessible cardinal is a limit of subtle cardinals.' The existence of such a model is not proved or cited, and it is not immediate from the consistency of ZFC + 'there is a proper class of subtle cardinals', since in L the class of all subtle cardinals may have inaccessible limit points. This assumption is load-bearing: the claim that V[G] has no inaccessible cardinals uses the inequality R(δ)<κ for an inaccessible κ in V[G], and if κ were an inaccessible limit of the chosen class S in the ground model, then sup(S∩δ)=κ and R(δ)>κ, so the argument would fail. Please supply a proof or reference that the required starting model exists, or modify the construction to use a sparse subclass of subtle cardinals with no inaccessible limit point.
- [Section 4, proof of Theorem 1.14, factor analysis] After the 'standard factor analysis', the proof asserts 'Then δ is a subtle cardinal in M'. This is true, but it is not automatic from P(δ)^M⊆V alone, and the step is not justified in the text. A δ-sequence ⟨A_α | α<δ⟩ with A_α⊆α is coded by a subset of δ×δ, hence by a subset of δ via a standard pairing function; since P(δ)^M⊆V, both the code and any M-club C⊆δ lie in V, so subtlety of δ in V applies to the decoded sequence and club. Please add this argument (or a reference) at this point.
minor comments (3)
- [Section 1, after Definition 1.3] The claim that 'Ord is essentially subtle' is downward absolute to HOD in the first case of Corollary 4.5 would benefit from a brief justification: HOD-definable class sequences and club classes are V-definable via the definition of HOD, so the scheme in V directly yields the scheme in HOD.
- [Section 4, proof of Theorem 1.14] In the sentence 'Then δ is a subtle cardinal in M', the paper should also clarify that the relevant sequence in M is coded by a subset of δ, since the values A_α are subsets of α and hence the entire sequence is a subset of δ×δ.
- [Title and throughout] There are occasional typographical issues, such as 'comp actness' in the title, which should be corrected to 'compactness'.
Circularity Check
No significant circularity: the paper's derivations reduce to external published theorems and internally proven lemmas, not to their own conclusions.
full rationale
The paper's central results (Theorems 1.4, 1.6, and 5.5) are proven by establishing new equivalences between the combinatorial schemes 'Ord is essentially faint'/'Ord is essentially subtle' and the existence of C(n)-weakly shrewd / C(n)-strongly unfoldable cardinals, and then connecting these large-cardinal notions to weak compactness and Löwenheim–Skolem–Tarski numbers for abstract logics. Theorem 2.4, cited from the author's prior work with Bagaria, is load-bearing but it is an independent published characterization with explicit proofs and assumptions that do not include the target results; its use is therefore genuine external support, not circular self-citation. The main model-theoretic direction (Lemma 6.1) derives weak compactness from C(n)-weak shrewdness by constructing elementary submodels via Lemma 3.3, without assuming the logic already has a weak compactness cardinal. The converse direction (Lemma 6.4) constructs an abstract logic that codes failures of C(n)-weak shrewdness and uses the assumed compactness or LST property to force the existence of such a cardinal; this is a standard contradiction argument, not a presupposition of the conclusion. Two technical assertions are unsupported and flagged as correctness risks rather than circularity: Corollary 4.5 assumes 'Ord is essentially subtle in HOD' without proof, and Theorem 1.14 asserts 'Then δ is a subtle cardinal in M' after the factor analysis, which does not obviously follow from P(δ)^M⊆V. However, neither step reduces the theorem to its own statement; each is a preservation/absoluteness gap in an otherwise non-circular derivation. No fitted parameters are renamed as predictions, no known result is merely renamed, and no conclusion is assumed as a premise.
Assumptions & free parameters
assumptions (4)
- standard math ZFC
- domain assumption The seven axioms of abstract logic (Definition 5.2)
- domain assumption Consistency of a proper class of subtle cardinals (in the relevant theorems)
- domain assumption V=L ground model for the forcing in Theorem 1.14
Cite this review
Pith. "Pith review of Weak compactness cardinals for strong logics and subtlety properties of the class of ordinals." pith.science (2026). https://pith.science/paper/C5OLYKKA
@misc{pith2026241117568,
author = {Pith},
title = {Pith review of: Weak compactness cardinals for strong logics and subtlety properties of the class of ordinals},
year = {2026},
howpublished = {\url{https://pith.science/paper/C5OLYKKA}},
note = {Machine review of arXiv:2411.17568}
}
read the original abstract
Motivated by recent work of Boney, Dimopoulos, Gitman and Magidor, we characterize the existence of weak compactness cardinals for all abstract logics through combinatorial properties of the class of ordinals. This analysis is then used to show that, in contrast to the existence of strong compactness cardinals, the existence of weak compactness cardinals for abstract logics does not imply the existence of a strongly inaccessible cardinal. More precisely, it is proven that the existence of a proper class of subtle cardinals is consistent with the axioms of ZFC if and only if it is not possible to derive the existence of strongly inaccessible cardinals from the existence of weak compactness cardinals for all abstract logics. Complementing this result, it is shown that the existence of weak compactness cardinals for all abstract logics implies that unboundedly many ordinals are strongly inaccessible in the inner model HOD of all hereditarily ordinal definable sets.
Reference graph
Works this paper leans on
-
[5]
Will Boney, Stamatis Dimopoulos, Victoria Gitman, and Me nachem Magidor, Model theoretic characterizations of large cardinals revisited , Trans. Amer. Math. Soc. 377 (2024), no. 10, 6827–6861
work page 2024
-
[2]
Joan Bagaria and Philipp L¨ ucke, Patterns of Structural Reflection in the large-cardinal hie rarchy, Trans. Amer. Math. Soc. 377 (2024), no. 5, 3397–3447
work page 2024
-
[1]
Joan Bagaria, C(n)-cardinals, Arch. Math. Logic 51 (2012), no. 3-4, 213–240
work page 2012
-
[3]
Joan Bagaria and Jouko V¨ a¨ an¨ anen,On the symbiosis between model-theoretic and set-theoreti c properties of large cardinals, J. Symb. Log. 81 (2016), no. 2, 584–604
work page 2016
-
[4]
Will Boney, Model theoretic characterizations of large cardinals , Israel J. Math. 236 (2020), no. 1, 133–181
work page 2020
-
[6]
Chen C. Chang and H. Jerome Keisler, Model theory, third ed., Studies in Logic and the Foundations of Mathe- matics, vol. 73, North-Holland Publishing Co., Amsterdam, 1990
work page 1990
-
[7]
Devlin, Constructibility, Perspectives in Mathematical Logic, Springer-Verlag, Be rlin, 1984
Keith J. Devlin, Constructibility, Perspectives in Mathematical Logic, Springer-Verlag, Be rlin, 1984
work page 1984
-
[8]
Saka´ e Fuchino and Hiroshi Sakai,Weakly extendible cardinals and compactness of extended lo gics, preprint, 2022
work page 2022
Show all 21 references
-
[9]
Peter Holy, Philipp L¨ ucke, and Sandra M¨ uller,Outward compactness, to appear in the Israel Journal of Mathe- matics, 2025
2025
-
[10]
Thomas Jech, Set theory , Springer Monographs in Mathematics, Springer-Verlag, Be rlin, 2003, The third mil- lennium edition, revised and expanded
2003
-
[11]
Jensen and Kenneth Kunen, Some combinatorial properties of L and V , handwritten notes, 1969
Ronald B. Jensen and Kenneth Kunen, Some combinatorial properties of L and V , handwritten notes, 1969
1969
-
[12]
Philipp L¨ ucke, Strong unfoldability, shrewdness and combinatorial conse quences, Proc. Amer. Math. Soc. 150 (2022), no. 9, 4005–4020. 13. , Structural reflection, shrewd cardinals and the size of the c ontinuum, J. Math. Log. 22 (2022), no. 2, Paper No. 2250007, 43
2022
-
[14]
Menachem Magidor, On the role of supercompact and extendible cardinals in logi c, Israel J. Math. 10 (1971), 147–157
1971
-
[15]
Menachem Magidor and Jouko V¨ a¨ an¨ anen,On L¨ owenheim-Skolem-Tarski numbers for extensions of firs t order logic, J. Math. Log. 11 (2011), no. 1, 87–113
2011
-
[16]
Makowsky, Vopˇ enka’s principle and compact logics, J
Johann A. Makowsky, Vopˇ enka’s principle and compact logics, J. Symbolic Logic 50 (1985), no. 1, 42–48
1985
-
[17]
Pierre Matet, Some aspects of n-subtlety, Z. Math. Logik Grundlag. Math. 34 (1988), no. 2, 189–192
1988
-
[18]
Mitchell, On the singular cardinal hypothesis , Trans
William J. Mitchell, On the singular cardinal hypothesis , Trans. Amer. Math. Soc. 329 (1992), no. 2, 507–530
1992
-
[19]
Symbolic Logic 1 (1995), no
Michael Rathjen, Recent advances in ordinal analysis: Π 1 2-CA and related systems , Bull. Symbolic Logic 1 (1995), no. 4, 468–485
1995
-
[20]
Solovay, Strongly compact cardinals and the GCH , Proceedings of the Tarski Symposium, Proc
Robert M. Solovay, Strongly compact cardinals and the GCH , Proceedings of the Tarski Symposium, Proc. Sym- pos. Pure Math., vol. Vol. XXV, Published for the Associatio n for Symbolic Logic by the American Mathematical Society, Providence, RI, 1974, pp. 365–372. WEAK COMPACTNE...
1974
-
[21]
Solovay, William N
Robert M. Solovay, William N. Reinhardt, and Akihiro Kan amori, Strong axioms of infinity and elementary embeddings, Ann. Math. Logic 13 (1978), no. 1, 73–116
1978
-
[22]
Symbolic Logic 63 (1998), no
Andr´ es Villaveces, Chains of end elementary extensions of models of set theory , J. Symbolic Logic 63 (1998), no. 3, 1116–1136. Philipp L ¨ucke. F achbereich Mathematik, Universit ¨at Hamburg, Bundesstraße 55, Hamburg, 20146, Germany Email address : philipp.luecke@uni-hamburg.de
1998
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.