Switch to: References

Add citations

You must login to add citations.
  1. Rasiowa–Sikorski Deduction Systems with the Rule of Cut: A Case Study.Dorota Leszczyńska-Jasion, Mateusz Ignaszak & Szymon Chlebowski - 2019 - Studia Logica 107 (2):313-349.
    This paper presents Rasiowa–Sikorski deduction systems for logics \, \, \ and \. For each of the logics two systems are developed: an R–S system that can be supplemented with admissible cut rule, and a \-version of R–S system in which the non-admissible rule of cut is the only branching rule. The systems are presented in a Smullyan-like uniform notation, extended and adjusted to the aims of this paper. Completeness is proved by the use of abstract refutability properties which are (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151 - 177.
    The aim of this paper is to present a loop-free decision procedure for modal propositional logics K4, S4 and S5. We prove that the procedure terminates and that it is sound and complete. The procedure is based on the method of Socratic proofs for modal logics, which is grounded in the logic of questions IEL.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Dual Erotetic Calculi and the Minimal $${\Mathsf{LFI}}$$ LFI.Dorota Leszczyńska-Jasion & Szymon Chlebowski - 2015 - Studia Logica 103 (6):1245-1278.
    An erotetic calculus for a given logic constitutes a sequent-style proof-theoretical formalization of the logic grounded in Inferential Erotetic Logic. In this paper, a new erotetic calculus for Classical Propositional Logic, dual with respect to the existing ones, is given. We modify the calculus to obtain complete proof systems for the propositional part of paraconsistent logic $${\mathsf{CLuN}}$$ CLuN and its extensions $${\mathsf{CLuNs}}$$ CLuNs and $${\mathsf{mbC}}$$ mbC. The method is based on dual resolution. Moreover, the resolution rule is non-clausal. According to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S5.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151-177.
    The aim of this paper is to present a loop-free decision procedure for modal propositional logics K4, S4 and S5. We prove that the procedure terminates and that it is sound and complete. The procedure is based on the method of Socratic proofs for modal logics, which is grounded in the logic of questions IEL.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark