•  58
    Logic in India—Editorial Introduction
    with Hans van Ditmarsch and Ramaswamy Ramanujam
    Journal of Philosophical Logic 40 (5): 557-561. 2011.
  •  60
    Probabilistic conditionals are almost monotonic
    Review 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
  •  91
    Vague predicates and language games
    Theoria 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
  •  127
    Sentences, 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
  •  30
    How 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
  •  127
    Conditional Probability and Defeasible Inference
    Journal 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
  •  131
    Game Logic - An Overview
    with Marc Pauly
    Studia 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.
  •  14
    Sock Sorting: An Example of a Vague Algorithm
    with Laxmi Parida and Vaughan Pratt
    Logic 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
  •  7
    Review: Robert Goldblatt, Logics of Time and Computation (review)
    Journal of Symbolic Logic 56 (4): 1495-1496. 1991.