Switch to: References

Add citations

You must login to add citations.
  1. Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
    We give a new proof of the following result : it is undecidable whether a given calculus, that is a finite set of propositional formulas together with the rules of modus ponens and substitution, axiomatizes the classical logic. Moreover, we prove the same for every superintuitionistic calculus. As a corollary, it is undecidable whether a given calculus is consistent, whether it is superintuitionistic, whether two given calculi have the same theorems, whether a given formula is derivable in a given calculus. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Translations and structure for partial propositional calculi.E. William Chapin - 1974 - Studia Logica 33 (1):35-57.
    Download  
     
    Export citation  
     
    Bookmark