Labelled Natural Deduction Systems for Propositional Non-Classical Logics

  • Luca Viganò


In the previous chapter we investigated labelled natural deduction presentations of propositional modal logics. Here we explore the generalizations needed to build ND systems for large families of propositional non-classical logics, including relevance logics (and, more generally, substructural logics [75, 76, 196]), where we can treat non-classical negation as a modal operator and also consider explicitly positive fragments. (The metatheory of positive logics is different from that for ‘full’ logics; see, e.g., Dunn’s semantic analysis of positive modal logics in [80].) We generalize our framework to provide a uniform treatment of a wide range of non-classical operators (□, ◊, relevant and intuitionistic implication, non-classical negation, etc.), where we base our presentations on an abstract classification of non-classical operators as ‘universal’ or ‘existential’, and associated general metatheorems. We proceed as follows.


Modal Logic Intuitionistic Logic Kripke Model Axiom Schema Relevance Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Luca Viganò
    • 1
  1. 1.Institut für InformatikAlbert-Ludwigs-Universität FreiburgFreiburg im BreisgauGermany

Personalised recommendations