Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Artemov, Sergei
and
Kuznets, Roman
2009.
Logical omniscience as a computational complexity problem.
p.
14.
Başķent, Can
Loohuis, Loes Olde
and
Parikh, Rohit
2012.
ON KNOWLEDGE AND OBLIGATION.
Episteme,
Vol. 9,
Issue. 2,
p.
171.
Allo, Patrick
2013.
The Many Faces of Closure and Introspection.
Journal of Philosophical Logic,
Vol. 42,
Issue. 1,
p.
91.
Yamada, Tomoyuki
2014.
Interdisciplinary Works in Logic, Epistemology, Psychology and Linguistics.
Vol. 3,
Issue. ,
p.
181.
Artemov, Sergei
and
Kuznets, Roman
2014.
Logical omniscience as infeasibility.
Annals of Pure and Applied Logic,
Vol. 165,
Issue. 1,
p.
6.
Parikh, Rohit
2014.
David Makinson on Classical Methods for Non-Classical Problems.
Vol. 3,
Issue. ,
p.
143.
D'Agostino, Marcello
2015.
An informational view of classical logic.
Theoretical Computer Science,
Vol. 606,
Issue. ,
p.
79.
Floyd, Juliet
2017.
Rohit Parikh on Logic, Language and Society.
Vol. 11,
Issue. ,
p.
1.
Proietti, Carlo
and
Yuste-Ginel, Antonio
2021.
Dynamic epistemic logics for abstract argumentation.
Synthese,
Vol. 199,
Issue. 3-4,
p.
8641.
Solaki, Anthia
Berto, Francesco
and
Smets, Sonja
2021.
The Logic of Fast and Slow Thinking.
Erkenntnis,
Vol. 86,
Issue. 3,
p.
733.
Elga, Adam
and
Rayo, Agustín
2022.
Fragmentation and logical omniscience.
Noûs,
Vol. 56,
Issue. 3,
p.
716.
Soysal, Zeynep
2023.
A metalinguistic and computational approach to the problem of mathematical omniscience.
Philosophy and Phenomenological Research,
Vol. 106,
Issue. 2,
p.
455.
Greco, Daniel
2023.
Idealization in Epistemology.
SOYSAL, ZEYNEP
2024.
AN ALGORITHMIC IMPOSSIBLE-WORLDS MODEL OF BELIEF AND KNOWLEDGE.
The Review of Symbolic Logic,
Vol. 17,
Issue. 2,
p.
586.