Switch to: Citations

Add references

You must login to add references.
  1. An Introduction to Modal Logic.George Edward Hughes & M. J. Cresswell - 1968 - London, England: Methuen. Edited by M. J. Cresswell.
  • On formulas of one variable in intuitionistic propositional calculus.Iwao Nishimura - 1960 - Journal of Symbolic Logic 25 (4):327-331.
  • On canonicity and strong completeness conditions in intermediate propositional logics.Silvio Ghilardi & Pierangelo Miglioli - 1999 - Studia Logica 63 (3):353-385.
    By using algebraic-categorical tools, we establish four criteria in order to disprove canonicity, strong completeness, w-canonicity and strong w-completeness, respectively, of an intermediate propositional logic. We then apply the second criterion in order to get the following result: all the logics defined by extra-intuitionistic one-variable schemata, except four of them, are not strongly complete. We also apply the fourth criterion in order to prove that the Gabbay-de Jongh logic D1 is not strongly w-complete.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A method to single out maximal propositional logics with the disjunction property I.Mauro Ferrari & Pierangelo Miglioli - 1995 - Annals of Pure and Applied Logic 76 (1):1-46.
    This is the first part of a paper concerning intermediate propositional logics with the disjunction property which cannot be properly extended into logics of the same kind, and are therefore called maximal. To deal with these logics, we use a method based on the search of suitable nonstandard logics, which has an heuristic content and has allowed us to discover a wide family of logics, as well as to get their maximality proofs in a uniform way. The present part illustrates (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • A method to single out maximal propositional logics with the disjunction property II.Mauro Ferrari & Pierangelo Miglioli - 1995 - Annals of Pure and Applied Logic 76 (2):117-168.
    This is the second part of a paper devoted to the study of the maximal intermediate propositional logics with the disjunction property , whose first part has appeared in this journal with the title “A method to single out maximal propositional logics with the disjunction property I”. In the first part we have explained the general results upon which a method to single out maximal constructive logics is based and have illustrated such a method by exhibiting the Kripke semantics of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • An Introduction to Modal Logic.R. A. Bull - 1971 - Journal of Symbolic Logic 36 (2):328-328.
    Direct download  
     
    Export citation  
     
    Bookmark   29 citations  
  • The disjunction property of intermediate propositional logics.Alexander Chagrov & Michael Zakharyashchev - 1991 - Studia Logica 50 (2):189 - 216.
    This paper is a survey of results concerning the disjunction property, Halldén-completeness, and other related properties of intermediate prepositional logics and normal modal logics containing S4.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • Superconstructive Propositional Calculi with Extra Axiom Schemes Containing One Variable.J. G. Anderson - 1972 - Mathematical Logic Quarterly 18 (8-11):113-130.
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  • On completeness of intermediate predicate logics with respect to {K}ripke semantics.T. Shimura - 1995 - Bulletin of the Section of Logic 24:41-45.
    In spite of the existence of many examples of incomplete logics, it is an important problem to find intermediate predicate logics complete with respect to Kripke frame (or Kripke sheaf) semantics because they are closed under substitution. But, most of known completeness proofs of finitely axiomatizable logics are difficult to apply to other logics since they are highly dependent on the specific properties of given logics. So, it is preferable to find a general methods of completeness proof. We give some (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations