Introduces modal measurable logics and establishes their completeness via a modal extension of the Loomis-Sikorski theorem and restricted Jonsson-Tarski duality.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Choquet rationalizability is characterized by common belief in Choquet rationality, equals IESDA in an extended game, and shrinks or grows with ambiguity love or aversion.
A belief-base semantics for epistemic logic is defined that derives possible worlds from belief bases, enabling a compact universal epistemic model with equivalence results and a complexity bound.
citing papers explorer
-
Common Belief in Choquet Rationality and Ambiguity Attitudes -- Extended Abstract
Choquet rationalizability is characterized by common belief in Choquet rationality, equals IESDA in an extended game, and shrinks or grows with ambiguity love or aversion.
-
Exploiting Belief Bases for Building Rich Epistemic Structures
A belief-base semantics for epistemic logic is defined that derives possible worlds from belief bases, enabling a compact universal epistemic model with equivalence results and a complexity bound.