Switch to: Citations

Add references

You must login to add references.
  1. Classical logic without bivalence.Tor Sandqvist - 2009 - Analysis 69 (2):211-218.
    Semantic justifications of the classical rules of logical inference typically make use of a notion of bivalent truth, understood as a property guaranteed to attach to a sentence or its negation regardless of the prospects for speakers to determine it as so doing. For want of a convincing alternative account of classical logic, some philosophers suspicious of such recognition-transcending bivalence have seen no choice but to declare classical deduction unwarranted and settle for a weaker system; intuitionistic logic in particular, buttressed (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • On the idea of a general proof theory.Dag Prawitz - 1974 - Synthese 27 (1-2):63 - 77.
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
  • Inversion by definitional reflection and the admissibility of logical rules: Inversion by definitional reflection.Wagner De Campos Sanz - 2009 - Review of Symbolic Logic 2 (3):550-569.
    The inversion principle for logical rules expresses a relationship between introduction and elimination rules for logical constants. Hallnäs & Schroeder-Heister proposed the principle of definitional reflection, which embodies basic ideas of inversion in the more general context of clausal definitions. For the context of admissibility statements, this has been further elaborated by Schroeder-Heister. Using the framework of definitional reflection and its admissibility interpretation, we show that, in the sequent calculus of minimal propositional logic, the left introduction rules are admissible when (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Inversion by definitional reflection and the admissibility of logical rules.Wagner Campos Sanz & Thomas Piecha - 2009 - Review of Symbolic Logic 2 (3):550-569.
    The inversion principle for logical rules expresses a relationship between introduction and elimination rules for logical constants. Hallnäs & Schroeder-Heister proposed the principle of definitional reflection, which embodies basic ideas of inversion in the more general context of clausal definitions. For the context of admissibility statements, this has been further elaborated by Schroeder-Heister . Using the framework of definitional reflection and its admissibility interpretation, we show that, in the sequent calculus of minimal propositional logic, the left introduction rules are admissible (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations