-
24Review of “Epistemology, A Contemporary Introduction to the Theory of Knowledge” (review)Essays in Philosophy 9 (2): 6. 2008.
-
24Meeting of the Association for Symbolic Logic, New York City, May 1987Journal of Symbolic Logic 53 (4): 1270-1274. 1988.
-
22It is a sunny autumn day, and our protagonists have taken their meals outside, to enjoy the mild rays of the September sun. The NIAS cook Paul Nolte, as always glowing with pride while serving out his delicious food, has prepared a traditional Dutch meal today with sausage, red cabbage and pieces of apple
-
19Knowledge, behavior, and rationality: rationalizability in epistemic gamesArchive for Mathematical Logic 60 (5): 599-623. 2021.In strategic situations, agents base actions on knowledge and beliefs. This includes knowledge about others’ strategies and preferences over strategy profiles, but also about other external factors. Bernheim and Pearce in 1984 independently defined the game theoretic solution concept of rationalizability, which is built on the premise that rational agents will only take actions that are the best response to some situation that they consider possible. This accounts for other agents’ rationality a…Read more
-
19Review: Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi, Reasoning about Knowledge (review)Journal of Symbolic Logic 62 (4): 1484-1487. 1997.
-
17Goldblatt Robert. Logics of time and computation. Second edition of LVI 1495. CSLI lecture notes, no. 7. Center for the Study of Language and Information, Stanford 1992, also distributed by the University of Chicago Press, Chicago, ix + 180 pp (review)Journal of Symbolic Logic 60 (1): 347-347. 1995.
-
17Review of “If P, then Q; Conditionals and the Foundations of Reasoning” (review)Essays in Philosophy 7 (1): 12. 2006.
-
17Review of Epistemology, A Contemporary Introduction to the Theory of Knowledge, by Robert Audi (review)Essays in Philosophy 9 (2): 261-262. 2008.
-
15Finite information logicAnnals of Pure and Applied Logic 134 (1): 83-93. 2005.We introduce a generalization of Independence Friendly logic in which Eloise is restricted to a finite amount of information about Abelard’s moves. This logic is shown to be equivalent to a sublogic of first-order logic, to have the finite model property, and to be decidable. Moreover, it gives an exponential compression relative to logic
-
14Georg Kreisel and William W. Tait. Finite definability of number-theoretic functions and parametric completeness of equational calculi. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 28–38 (review)Journal of Symbolic Logic 32 (2): 270-271. 1967.
-
14Sock Sorting: An Example of a Vague AlgorithmLogic Journal of the IGPL 9 (5): 687-692. 2001.We give an example of a polynomial time algorithm for a particular algorithmic problem involving vagueness and visual indiscriminability, namely sock sorting
-
13Goldblatt Robert. Logics of time and computation. CSLI lecture notes, no. 7. Center for the Study of Language and Information, Stanford 1987, also distributed by the University of Chicago Press, Chicago, ix + 131 pp (review)Journal of Symbolic Logic 56 (4): 1495-1496. 1991.
-
13Approximate belief revisionLogic Journal of the IGPL 9 (6): 755-768. 2001.The standard theory for belief revision provides an elegant and powerful framework for reasoning about how a rational agent should change its beliefs when confronted with new information. However, the agents considered are extremely idealized. Some recent models attempt to tackle the problem of plausible belief revision by adding structure to the belief bases and using nonstandard inference operations. One of the key ideas is that not all of an agent's beliefs are relevant for an operation of be…Read more
-
10Logic, co-ordination and the envelope of our beliefsLogic Journal of the IGPL 31 (6): 1069-1077. 2023.Each of us has a story which we can think of as a set of beliefs, hopefully consistent. We make our decisions in view of our beliefs which may be probabilistic, in the general case, but simple yes or no as in this paper. Our beliefs are our envelope just as the shell of a tortoise is its envelope. Decision theory—or single agent game theory tells us when to make the best choice in a game of us against nature. But nature has no desire to further or frustrate our efforts. Nature is mysterious but …Read more
-
10Data storage interpretation of labeled modal logicAnnals of Pure and Applied Logic 78 (1-3): 57-71. 1996.
-
10Review: Sheila Greibach, A New Normal-Form Theorem for Context-Free Phase Structure Grammars (review)Journal of Symbolic Logic 34 (4): 658-658. 1969.
-
10Harel David. Proving the correctness of regular deterministic programs: a unifying survey using dynamic logic. Theoretical computer science, vol. 12 , pp. 61–81 (review)Journal of Symbolic Logic 50 (2): 552-553. 1985.
-
81997-1998 Winter Meeting of the Association for Symbolic LogicBulletin of Symbolic Logic 4 (2): 217-224. 1998.
-
8Review: David Harel, Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic (review)Journal of Symbolic Logic 50 (2): 552-553. 1985.
-
7Proof, Computation and Agency: Logic at the Crossroads (edited book)Springer. 2011.Proof, Computation and Agency: Logic at the Crossroads provides an overview of modern logic and its relationship with other disciplines. As a highlight, several articles pursue an inspiring paradigm called 'social software', which studies patterns of social interaction using techniques from logic and computer science. The book also demonstrates how logic can join forces with game theory and social choice theory. A second main line is the logic-language-cognition connection, where the articles co…Read more
-
7Review: Robert Goldblatt, Logics of Time and Computation (review)Journal of Symbolic Logic 56 (4): 1495-1496. 1991.
-
6From Language Games to Social SoftwareIn Alexander Hieke & Hannes Leitgeb (eds.), Reduction, abstraction, analysis: proceedings of the 31th International Ludwig Wittgenstein-Symposium in Kirchberg, 2008, De Gruyter. pp. 365-376. 2009.
-
4Review: Georg Kreisel, William W. Tait, Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi (review)Journal of Symbolic Logic 32 (2): 270-271. 1967.
-
2Review: Robert Goldblatt, Logics of Time and Computation (review)Journal of Symbolic Logic 60 (1): 347-347. 1995.
-
2Justified True Belief: Plato, Gettier, and TuringIn Alisa Bokulich & Juliet Floyd (eds.), Philosophical Explorations of the Legacy of Alan Turing, Springer Verlag. 2017.
New York City, New York, United States of America
Areas of Specialization
Philosophy of Language |
Logic and Philosophy of Logic |