School of Historical and Philosophical Studies - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/398

Filters

2002 - 2009 9
Reset filters

Settings
Statistics
Citations
Start date: 2000 × End date: 2009 × Author: Restall, Gregory × Type: Journal Article ×

Search Results

Now showing 1 - 9 of 9
  • Item
    Thumbnail Image
    Truth values and proof theory
    Restall, G (Springer Science and Business Media LLC, 2009-07-01)
  • Item
    Thumbnail Image
    On Permutation in Simplified Semantics
    Restall, G ; Roy, T (SPRINGER, 2009-06)
  • Item
    Thumbnail Image
    Constant domain quantified modal logics without Boolean negation
    RESTALL, GA (Victoria University of Wellington, 2005)
    This paper provides a sound and complete axiomatisation for constant domain modal logics without Boolean negation. This is a simpler case of the difficult problem of providing a sound and complete axiomatisation for constant-domain quantified relevant logics, which can be seen as a kind of modal logic with a twoplace modal operator, the relevant conditional. The completeness proof is adapted from a proof for classical modal predicate logic (I follow James Garson’s presentation of the completeness proof quite closely [10]), but with an important twist, to do with the absence of Boolean negation.
  • Item
    Thumbnail Image
    MODAL MODELS FOR BRADWARDINE'S THEORY OF TRUTH
    Restall, G (CAMBRIDGE UNIV PRESS, 2008-08)
  • Item
    No Preview Available
    One way to face facts
    Restall, G (BLACKWELL PUBL LTD, 2004-07)
  • Item
    No Preview Available
    Carnap's tolerance, meaning, and logical pluralism
    RESTALL, GA ( 2002)
  • Item
    No Preview Available
    Just What Is Full-Blooded Platonism?†
    RESTALL, G (Oxford University Press (OUP), 2003-02-01)
  • Item
    No Preview Available
    Relevant restricted quantification
    Beall, JC ; Brady, RT ; Hazen, AP ; Priest, G ; Restall, G (SPRINGER, 2006-12)
  • Item
    No Preview Available
    The geometry of non-distributive logics
    Restall, G ; Paoli, F (CAMBRIDGE UNIV PRESS, 2005-12)
    Abstract In this paper we introduce a new natural deduction system for the logic of lattices, and a number of extensions of lattice logic with different negation connectives. We provide the class of natural deduction proofs with both a standard inductive definition and a global graph-theoretical criterion for correctness, and we show how normalisation in this system corresponds to cut elimination in the sequent calculus for lattice logic. This natural deduction system is inspired both by Shoesmith and Smiley's multiple conclusion systems for classical logic and Girard's proofnets for linear logic.