Answers are grounded in this paper and cite their sources.
Axiomatization of capacity quantifiers in logic reveals new completeness properties, enhancing measure theory.
Hoover and Keisler's Probability Logic is a variant of first‐order logic that replaces the standard quantifiers and with probability quantifiers . The expression is interpreted as “the set has probability at least .” We extend this logic to capacities, a generalization of measures that need not be additive, allowing statements of the form , interpreted as “the set has capacity at least .” By axiomatizing the defining properties of a special class of capacities called strongly subadditive capacities, we establish a completeness theorem for our logic with capacity quantifiers.
No takes yet. Share an insight, caveat, or question.
Janitha Aswedige (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: