Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)Relational dual tableau decision procedures and their applications to modal and intuitionistic logics.Joanna Golińska-Pilarek, Taneli Huuskonen & Emilio Muñoz-Velasco - 2014 - Annals of Pure and Applied Logic 165 (2):409-427.
    This paper introduces Basic Intuitionistic Set Theory BIST, and investigates it as a first-order set theory extending the internal logic of elementary toposes. Given an elementary topos, together with the extra structure of a directed structural system of inclusions on the topos, a forcing-style interpretation of the language of first-order set theory in the topos is given, which conservatively extends the internal logic of the topos. This forcing interpretation applies to an arbitrary elementary topos, since any such is equivalent to (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Dual tableau-based decision procedures for relational logics with restricted composition operator.Domenico Cantone, Marianna Nicolosi Asmundo & Ewa Orlowska - 2011 - Journal of Applied Non-Classical Logics 21 (2):177-200.
    We consider fragments of the relational logic RL(1) obtained by posing various constraints on the relational terms involving the operator of composition of relations. These fragments allow to express several non classical logics including modal and description logics. We show how relational dual tableaux can be employed to provide decision procedures for each of them.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • 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  
  • Automatic proof generation in an axiomatic system for $\mathsf{CPL}$ by means of the method of Socratic proofs.Aleksandra Grzelak & Dorota Leszczyńska-Jasion - 2018 - Logic Journal of the IGPL 26 (1):109-148.
    Download  
     
    Export citation  
     
    Bookmark   2 citations