Switch to: References

Add citations

You must login to add citations.
  1. Some results concerning finite model separability of propositional calculi.Ronald Harrop - 1976 - Studia Logica 35 (2):179 - 189.
    Download  
     
    Export citation  
     
    Bookmark  
  • For Want of an ‘And’: A Puzzle about Non-Conservative Extension.Lloyd Humberstone - 2005 - History and Philosophy of Logic 26 (3):229-266.
    Section 1 recalls a point noted by A. N. Prior forty years ago: that a certain formula in the language of a purely implicational intermediate logic investigated by R. A. Bull is unprovable in that logic but provable in the extension of the logic by the usual axioms for conjunction, once this connective is added to the language. Section 2 reminds us that every formula is interdeducible with (i.e. added to intuitionistic logic, yields the same intermediate logic as) some conjunction-free (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Matrix approach in methodology of sentential calculi.Ryszard Wójcicki - 1973 - Studia Logica 32 (1):7 - 39.
    Download  
     
    Export citation  
     
    Bookmark   82 citations  
  • A mind of a non-countable set of ideas.Alexander Citkin - 2008 - Logic and Logical Philosophy 17 (1-2):23-39.
    The paper is dedicated to the 80th birthday of the outstanding Russian logician A.V. Kuznetsov. It is addressing a history of the ideas and research conducted by him in non-classical and intermediate logics.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Restricted Extensions of Implicational Calculi.Biswambhar Pahi - 1971 - Mathematical Logic Quarterly 17 (1):11-16.
    Download  
     
    Export citation  
     
    Bookmark  
  • An application of kripke's completeness theorem for intuitionism to superconstructive propositional calculi.J. G. Anderson - 1969 - Mathematical Logic Quarterly 15 (16-18):259-288.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Answer to a question raised by Harrop.Dolph Ulrich - 1982 - Bulletin of the Section of Logic 11 (3/4):140-141.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The finite model property and recursive Bounds on the size of countermodels.Dolph Ulrich - 1983 - Journal of Philosophical Logic 12 (4):477 - 480.
    Download  
     
    Export citation  
     
    Bookmark  
  • Kilka uwag O pojęciu zupeŀności rachunku zdań. I.Witold A. Pogorzelski - 1968 - Studia Logica 23 (1):43 - 58.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)A Single‐Axiom Impligational Calculus of Given Unsolvability.M. D. Gladstone - 1968 - Mathematical Logic Quarterly 14 (13-17):193-204.
    Download  
     
    Export citation  
     
    Bookmark  
  • An undecidable relevant logic.Robert K. Meyer & Richard Routley - 1973 - Mathematical Logic Quarterly 19 (26‐29):389-397.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the Equivalence for Non‐Derivability Testing of Finite Smiley Models and Finite Modified Smiley Models.Ronald Harrop - 1971 - Mathematical Logic Quarterly 17 (1):137-143.
    Download  
     
    Export citation  
     
    Bookmark  
  • Full Models for Sentential Logics.Josep Maria Font & Ramon Jansana - 1995 - Bulletin of the Section of Logic 24 (3):123-131.
    Download  
     
    Export citation  
     
    Bookmark