Answers are grounded in this paper and cite their sources.
We show that, in terms of closure ordinals, many infinitary calculi for “first-order” logics of probability (i.e., for languages similar to those in [M. Abadi and J. Y. Halpern, “Decidability and expressiveness for first-order logics of probability,” Inform. and Comput. 112 (1), 1–36, 1994] are as hard as possible: the corresponding closure ordinals coincide with the least nonconstructive ordinal, denoted by ω₁CK .
No takes yet. Share an insight, caveat, or question.
S. O. Speranski (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: