-
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.
-
40Completeness of Certain Bimodal Logics for Subset SpacesStudia Logica 71 (1): 1-30. 2002.Subset Spaces were introduced by L. Moss and R. Parikh in [8]. These spaces model the reasoning about knowledge of changing states.In [2] a kind of subset space called intersection space was considered and the question about the existence of a set of axioms that is complete for the logic of intersection spaces was addressed. In [9] the first author introduced the class of directed spaces and proved that any set of axioms for directed frames also characterizes intersection spaces.We give here a c…Read more
-
80A knowledge based semantics of messagesJournal of Logic, Language and Information 12 (4): 453-467. 2003.We investigate the semantics of messages, and argue that the meaning ofa message is naturally and usefully given in terms of how it affects theknowledge of the agents involved in the communication. We note thatthis semantics depends on the protocol used by the agents, and thus not only the message itself, but also the protocol appears as a parameter in the meaning. Understanding this dependence allows us to give formal explanations of a wide variety of notions including language dependence, impl…Read more
-
81997-1998 Winter Meeting of the Association for Symbolic LogicBulletin of Symbolic Logic 4 (2): 217-224. 1998.
-
Some Remarks on Knowledge, Games and SocietyJournal of the Indian Council of Philosophical Research 27 (1). 2010.
-
17Review of “If P, then Q; Conditionals and the Foundations of Reasoning” (review)Essays in Philosophy 7 (1): 12. 2006.
-
102Vagueness and utility: The semantics of common nouns (review)Linguistics and Philosophy 17 (6). 1994.A utility-based approach to the understanding of vague predicates (VPs) is proposed. It is argued that assignment of truth values to propositions containing VPs entails unjustifiable assumptions of consensus; two models of VP semantics are criticized on this basis: (1) the super-truth theory of Kit Fine (1975), which requires an unlikely consensus on base points; (2) the fuzzy logic of Lotfi Zadeh (1975), on fuzzy truth values of sentences. Pragmatism is held to provide a key: successful behavio…Read more
-
10Review: Sheila Greibach, A New Normal-Form Theorem for Context-Free Phase Structure Grammars (review)Journal of Symbolic Logic 34 (4): 658-658. 1969.
-
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.
-
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.
-
53Beth definability, interpolation and language splittingSynthese 179 (2). 2011.Both the Beth definability theorem and Craig's lemma (interpolation theorem from now on) deal with the issue of the entanglement of one language L1 with another language L2, that is to say, information transfer—or the lack of such transfer—between the two languages. The notion of splitting we study below looks into this issue. We briefly relate our own results in this area as well as the results of other researchers like Kourousias and Makinson, and Peppas, Chopra and Foo.Section 3 does contain …Read more
-
41Topological reasoning and the logic of knowledgeAnnals of Pure and Applied Logic 78 (1-3): 73-110. 1996.We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logic is in subset spaces , and we obtain complete axiomatizations for the sentences which hold in these interpretations. In addition, we axiomatize the validities of the smaller class of topological spaces in a system we call topologic . We also prove decidability for these two systems. Our results on topologic relate earl…Read more
-
112Social SoftwareSynthese 132 (3): 187-211. 2002.We suggest that the issue of constructing andverifying social procedures, which we suggestively call socialsoftware, be pursued as systematically as computer software is pursued by computer scientists. Certain complications do arise withsocial software which do not arise with computer software, but thesimilarities are nonetheless strong, and tools already exist which wouldenable us to start work on this important project. We give a variety ofsuggestive examples and indicate some theoretical work…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.
-
30Gems of theoretical computer science, Uwe schöning and Randall PruimJournal of Logic, Language and Information 9 (1): 131-132. 2000.
-
62Probabilistic conditionals are almost monotonicReview of Symbolic Logic 1 (1): 73-80. 2008.One interpretation of the conditional If P then Q is as saying that the probability of Q given P is high. This is an interpretation suggested by Adams (1966) and pursued more recently by Edgington (1995). Of course, this probabilistic conditional is nonmonotonic, that is, if the probability of Q given P is high, and R implies P, it need not follow that the probability of Q given R is high. If we were confident of concluding Q from the fact that we knew P, and we have stronger information R, we c…Read more
-
91Vague predicates and language gamesTheoria 11 (3): 97-107. 1996.Attempts to give a Logic or Semantics for vague predicates and to defuse the Sorites paradoxes have been largely a failure. We point out yet another problem with these predicates which has not been remarked on before,namely that different people do and must use these predicates in individually different ways. Thus even if there were a semantics for vague predicates, people would not be able to share it. To explain the occurrence nonetheless of these troublesome predicates in language, we propose…Read more
-
128Sentences, belief and logical omniscience, or what does deduction tell us?Review of Symbolic Logic 1 (4): 459-476. 2008.We propose a model for belief which is free of presuppositions. Current models for belief suffer from two difficulties. One is the well known problem of logical omniscience which tends to follow from most models. But a more important one is the fact that most models do not even attempt to answer the question what it means for someone to believe something, and just what it is that is believed. We provide a flexible model which allows us to give meaning to beliefs in general contexts, including th…Read more
-
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.
-
30How Far Can We Formalize Language Games?Vienna Circle Institute Yearbook 3 89-100. 1995.I want to start by giving some quotes from Wittgenstein. It is part of his conception of what the foundations of Mathematics are about, a conception which many people have found peculiar and one of my defects is that I am not able to find it peculiar anymore, but find it perfectly sensible
-
127Conditional Probability and Defeasible InferenceJournal of Philosophical Logic 34 (1). 2005.We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The exp…Read more
-
131Game Logic - An OverviewStudia Logica 75 (2): 165-182. 2003.Game Logic is a modal logic which extends Propositional Dynamic Logic by generalising its semantics and adding a new operator to the language. The logic can be used to reason about determined 2-player games. We present an overview of meta-theoretic results regarding this logic, also covering the algebraic version of the logic known as Game Algebra.
New York City, New York, United States of America
Areas of Specialization
Philosophy of Language |
Logic and Philosophy of Logic |