scientific article; zbMATH DE number 6606375

MaRDI QIDQ5740446zbMATH OpenFDO

Authors Joseph Y. Halpern, Rafael Pass

Publication date 26 July 2016

zbMATH Keywords

iterated admissibilitylexicographic probability sequences

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Logics of knowledge and belief (including belief change) (03B42) Rationality and learning in game theory (91A26)

Recommendations

• A conceptually well-founded characterization of iterated admissibility using an ``all I know operator
• All I know: A study in autoepistemic logic
• A sound and complete proof theory for the generalized logic of only knowing
• scientific article; zbMATH DE number 695095
• An alternative logic for knowability
• Lexicographic rationalizability and iterated admissibility
• On the decidability and complexity of reasoning about only knowing
• Admissibility and refutation: some characterisations of intermediate logics
• scientific article; zbMATH DE number 3321236
• Logics for knowability

Cited in

(8)

• Cautious belief and iterated admissibility
• Iterated admissibility through forcing in strategic belief models
• Admissibility and assumption
• Lexicographic beliefs and assumption
• Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information
• A unified epistemic analysis of iterated elimination algorithms from regret viewpoint
• Epistemic characterizations of iterated deletion of inferior strategy profiles in preference-based type spaces
• Characterizations of iterated admissibility based on PEGL

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740446)