Holborn, England, United Kingdom of Great Britain and Northern Ireland
Areas of Specialization
Science, Logic, and Mathematics
  • We explore ways in which purely qualitative belief change in the AGM tradition throws light on options in the treatment of conditional probability. First, by helping see why it can be useful to go beyond the ratio rule defining conditional from one-place probability. Second, by clarifying what is at stake in different ways of doing that. Third, by suggesting novel forms of conditional probability corresponding to familiar variants of qualitative belief change, and conversely. Likewise, we explai…Read more
  • We investigate introduction and elimination rules for truth-functional connectives, focusing on the general questions of the existence, for a given connective, of at least one such rule that it satisfies, and the uniqueness of a connective with respect to the set of all of them. The answers are straightforward in the context of rules using general set/set sequents of formulae, but rather complex and asymmetric in the restricted (but more often used) context of set/formula sequents, as also in th…Read more
  •  1
    Respecting relevance in belief change
    with George Kourousias
    In this paper dedicated to Carlos Alchourr´on, we review an issue that emerged only after his death in 1996, but would have been of great interest to him: To what extent do the formal operations of AGM belief change respect criteria of relevance? A natural (but also debateable) criterion was proposed in 1999 by Rohit Parikh, who observed that the AGM model does not always respect it. We discuss the pros and cons of this criterion, and explain how the AGM account may be refined, if we so desire, …Read more
  • We define and examine a notion of logical friendliness, which is a broadening of the familiar notion of classical consequence. The concept is tudied first in its simplest form, and then in a syntax-independent version, which we call sympathy. We also draw attention to the surprising number of familiar notions and operations with which it makes contact, providing a new light in which they may be seen.
  •  2
    The interplay of introduction and elimination rules for propositional connectives is often seen as suggesting a distinguished role for intuitionistic logic. We prove three formal results concerning intuitionistic propositional logic that bear on that perspective, and discuss their significance. First, for a range of connectives including both negation and the falsum, there are no classically or intuitionistically correct introduction rules. Second, irrespective of the choice of negation or the f…Read more
  •  4
    Non‐Equivalent Formulae in one Variable in A Strong Omnitemporal Modal Logic
    Mathematical Logic Quarterly 27 (7): 111-112. 2006.
  •  2
    Post Completeness and Ultrafilters
    Mathematical Logic Quarterly 20 (25‐27): 385-388. 2006.
  •  4
    On an inferential semantics for classical logic
    Logic Journal of the IGPL 22 (1): 147-154. 2014.
    We seek a better understanding of why an inferential semantics devised by Tor Sandqvist yields full classical logic, by providing and analysing a direct proof via a suitable maximality construction.
  •  15
    Conditional probability in the light of qualitative belief change
    Journal of Philosophical Logic 40 (2): 121-153. 2011.
    We explore ways in which purely qualitative belief change in the AGM tradition throws light on options in the treatment of conditional probability. First, by helping see why it can be useful to go beyond the ratio rule defining conditional from one-place probability. Second, by clarifying what is at stake in different ways of doing that. Third, by suggesting novel forms of conditional probability corresponding to familiar variants of qualitative belief change, and conversely. Likewise, we explai…Read more
  •  8
    Gödel’s Master Argument: what is it, and what can it do?
    IfCoLog Journal of Logics and Their Applications 2 (2): 1-16. 2015.
    This text is expository. We explain Gödel’s ‘Master Argument’ for incompleteness as distinguished from the 'official' proof of his 1931 paper, highlight its attractions and limitations, and explain how some of the limitations may be transcended by putting it in a more abstract form that makes no reference to truth.
  •  9
    Stenius' approach to disjunctive permission
    Theoria 50 (2‐3): 138-147. 2008.
    Summary THIS PAPER has two main purposes. First, to give an exposition of Stenius' approach to the logic of statements of disjunctive permission in such a way as to make manifest its differences with other main lines of attack in the literature. Second, to draw attention to some linguistic phenomena extending beyond the confines of deon‐tic discourse, that appear to reveal the inappropriateness of the other lines described, and to provide some confirmation of an approach, which we shall call the…Read more
  •  21
  •  29
    Screened revision
    Theoria 63 (1‐2): 14-23. 2008.
  •  11
    Book Review: Nicholas J.J. Smith, Logic: The Laws of Truth (review)
    Studia Logica 103 (1): 233-237. 2015.
  •  56
    Advice to the relevantist policeman
    In Vit Puncochar & Petr Svarny (eds.), The Logica Yearbook 2012, College Publications. pp. 91-100. 2013.
    Relevance logic is ordinarily seen as a subsystem of classical logic under the translation that replaces arrows by horseshoes. If, however, we consider the arrow as an additional connective alongside the horseshoe and other classical connectives, another perspective emerges. Relevance logic, specifically the system R, may be seen as the output of a conservative extension of classical consequence into the language with arrow.
  •  47
    A Guide to Ivan Orlov's "The calculus of the compatibility of propositions"
    with Werner Stelzner
    Australasian Journal of Logic 21 (1): 1-19. 2024.
    Ivan Efimovič Orlov’s paper “The calculus of the compatibility of propositions”, published in Russian in 1928, is fascinating for anyone interested in the early history of relevance, modal or intuitionistic logic. This is a guide that outlines Orlov's life and work, analyses the content of the paper, and relates it to work of his contemporaries and successors.
  •  42
    Aspectos de la lógica modal
    Universidad Nacional del Sur, Instituto de Matemática. 1971.
  •  69
    First-Order Friendliness
    Review of Symbolic Logic 17 (4): 1055-1069. 2024.
    In this note we study a counterpart in predicate logic of the notion of logical friendliness, introduced into propositional logic in [15]. The result is a new consequence relation for predicate languages with equality using first-order models. While compactness, interpolation and axiomatizability fail dramatically, several other properties are preserved from the propositional case. Divergence is diminished when the language does not contain equality with its standard interpretation.
  •  287
    Intuitionistic Logic and Elementary Rules
    Mind 120 (480): 1035-1051. 2011.
    The interplay of introduction and elimination rules for propositional connectives is often seen as suggesting a distinguished role for intuitionistic logic. We prove three formal results concerning intuitionistic propositional logic that bear on that perspective, and discuss their significance. First, for a range of connectives including both negation and the falsum, there are no classically or intuitionistically correct introduction rules. Second, irrespective of the choice of negation or the f…Read more
  •  116
    Some embedding theorems for modal logic
    Notre Dame Journal of Formal Logic 12 (2): 252-254. 1971.
    Some results on the upper end of the lattice of all modal propositional logics.
  •  39
    Boole's indefinite symbols re-examined
    Australasian Journal of Logic 19 (5). 2022.
    We show how one can give a clear formal account of Boole’s notorious “indefinite" (or “auxiliary”) symbols by treating them as variables that range over functions from classes to classes rather than just over classes while, at the same time, following Hailperin’s proposal of binding them existentially.
  •  125
    Frege’s Ontological Diagram Completed
    Logica Universalis 16 (3): 381-387. 2022.
    In a letter of 1891, Frege drew a diagram to illustrate his logical ontology. We observe that it omits features that play an important role in his thought on the matter, propose an extension of the diagram to include them, and compare with a diagram of the ontology of current first-order logic.
  •  38
    Relevance-Sensitive Truth-Trees
    In Ivo Düntsch & Edwin Mares (eds.), Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs, Springer Verlag. pp. 23-65. 2021.
    Our goal is to articulate a clear rationale for relevance-sensitive propositional logic. The method: truth-trees. Familiar decomposition rules for truth-functional connectives, accompanied by novel ones for the for the arrow, together with a recursive rule, generate a set of ‘acceptable’ formulae that properly contains all theorems of the well-known system R and is closed under substitution, conjunction, and detachment. We conjecture that it satisfies the crucial letter-sharing condition.
  •  107
    Screened Revision
    Theoria 63 (1-2): 14-23. 1997.
    Develops a concept of revision, akin in spirit to AGM partial meet revision, but in which the postulate of 'success' may fail. The basic idea is to see such an operation as composite, with a pre-processor using a priori considerations to resolve the question of whether to revise, following which another operation revises in a manner that protects the a priori material.
  •  28
    We investigate introduction and elimination rules for truth-functional connectives, focusing on the general questions of the existence, for a given connective, of at least one such rule that it satisfies, and the uniqueness of a connective with respect to the set of all of them. The answers are straightforward in the context of rules using general set/set sequents of formulae, but rather complex and asymmetric in the restricted (but more often used) context of set/formula sequents, as also in th…Read more