Switch to: References

Citations of:

The method of Socratic proofs for normal modal propositional logics

Poznań: Wydawn. Naukowe Uniwersytetu im. Adama Mickiewicza (2007)

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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • An Abductive Question-Answer System for the Minimal Logic of Formal Inconsistency $$\mathsf {mbC}$$ mbC.Szymon Chlebowski, Andrzej Gajda & Mariusz Urbański - 2021 - Studia Logica 110 (2):479-509.
    The aim in this paper is to define an Abductive Question-Answer System for the minimal logic of formal inconsistency \. As a proof-theoretical basis we employ the Socratic proofs method. The system produces abductive hypotheses; these are answers to abductive questions concerning derivability of formulas from sets of formulas. We integrated the generation of and the evaluation of hypotheses via constraints of consistency and significance being imposed on the system rules.
    Download  
     
    Export citation  
     
    Bookmark  
  • Dual Erotetic Calculi and the Minimal LFI.Szymon Chlebowski & Dorota Leszczyńska-Jasion - 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 CLuN and its extensions CLuNs and mbC. The method is based on dual resolution. Moreover, the resolution rule is non-clausal. According to the (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations