-
129On the provability logic of bounded arithmeticAnnals of Pure and Applied Logic 61 (1-2): 75-93. 1991.Let PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L ⊆ PLω < Th(C) where L is the provability logic of PA and Th(C) is a suitable class of Kripke frames
-
731Proceedings of the Workshop 'Reasoning about other minds: Logical and cognitive perspectives (edited book)WEUR Proceedings. 2011.In recent years, the human ability to reasoning about mental states of others in order to explain and predict their behavior has come to be a highly active area of research. Researchers from a wide range of fields { from biology and psychology through linguistics to game theory and logic{ contribute new ideas and results. This interdisciplinary workshop, collocated with the Thirteenth International Conference on Theoretical Aspects of Rationality and Knowledge (TARK XIII), aims to shed light on …Read more
-
161Strong Completeness and Limited Canonicity for PDLJournal of Logic, Language and Information 18 (2): 291-292. 2009.
-
208Logic and Social Cognition: The Facts Matter, and So Do Computational ModelsJournal of Philosophical Logic 38 (6): 649-680. 2009.This article takes off from Johan van Benthem’s ruminations on the interface between logic and cognitive science in his position paper “Logic and reasoning: Do the facts matter?”. When trying to answer Van Benthem’s question whether logic can be fruitfully combined with psychological experiments, this article focuses on a specific domain of reasoning, namely higher-order social cognition, including attributions such as “Bob knows that Alice knows that he wrote a novel under pseudonym”. For intel…Read more
-
161A communication algorithm for teamwork in multi-agent environmentsJournal of Applied Non-Classical Logics 19 (4): 431-461. 2009.Using a knowledge-based approach, we derive a protocol, MACOM1, for the sequence transmission problem from one agent to a group of agents. The protocol is correct for communication media where deletion and reordering errors may occur. Furthermore, it is shown that after k rounds the agents in the group attain depth k general knowledge about the members of the group and the values of the messages. Then, we adjust this algorithm for multi-agent communication for the process of teamwork. MACOM1 sol…Read more
-
99Review: J.-J. Ch. Meyer, W. van Der Hoek, Epistemic Logic for AI and Computer Science (review)Journal of Symbolic Logic 64 (4): 1837-1840. 1999.
-
168A small reflection principle for bounded arithmeticJournal of Symbolic Logic 59 (3): 785-812. 1994.We investigate the theory IΔ 0 + Ω 1 and strengthen [Bu86. Theorem 8.6] to the following: if NP ≠ co-NP. then Σ-completeness for witness comparison formulas is not provable in bounded arithmetic. i.e. $I\delta_0 + \Omega_1 + \nvdash \forall b \forall c (\exists a(\operatorname{Prf}(a.c) \wedge \forall = \leq a \neg \operatorname{Prf} (z.b))\\ \rightarrow \operatorname{Prov} (\ulcorner \exists a(\operatorname{Prf}(a. \bar{c}) \wedge \forall z \leq a \neg \operatorname{Prf}(z.\bar{b})) \urcorner))…Read more
-
198Children’s Application of Theory of Mind in Reasoning and LanguageJournal of Logic, Language and Information 17 (4): 417-442. 2008.Many social situations require a mental model of the knowledge, beliefs, goals, and intentions of others: a Theory of Mind (ToM). If a person can reason about other people’s beliefs about his own beliefs or intentions, he is demonstrating second-order ToM reasoning. A standard task to test second-order ToM reasoning is the second-order false belief task. A different approach to investigating ToM reasoning is through its application in a strategic game. Another task that is believed to involve th…Read more
-
University of GroningenFaculty of Philosophy
Department of Artificial Intelligence, Bernoulli Institute, Faculty of Science and EngineeringProfessor
Groningen, Groningen, Netherlands
Areas of Interest
Logic and Philosophy of Logic |
Epistemology |
Science, Logic, and Mathematics |