Rasiowa-Sikorski deduction systems with the rule of cut: a case study
From MaRDI portal
Publication:2422312
DOI10.1007/s11225-018-9795-7zbMath1494.03068OpenAlexW2796853096MaRDI QIDQ2422312
Dorota Leszczyńska-Jasion, Mateusz Ignaszak, Szymon Chlebowski
Publication date: 19 June 2019
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-018-9795-7
Cut-elimination and normal-form theorems (03F05) Abstract deductive systems (03B22) Paraconsistent logics (03B53)
Cites Work
- Relational dual tableau decision procedures and their applications to modal and intuitionistic logics
- Dual tableaux. Foundations, methodology, case studies
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
- Socratic proofs and paraconsistency: A case study
- Dual erotetic calculi and the minimal \(\mathsf{LFI}\)
- Tableaux and dual tableaux: transformation of proofs
- The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G.
- Proof methods for modal and intuitionistic logics
- Don't eliminate cut
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- Rasiowa-Sikorski deduction systems in computer science applications.
- Socratic proofs
- An abductive Question-Answer System for the minimal logic of formal inconsistency \(\mathsf{mbC}\)
- Translating non-classical logics into classical logic by using hidden variables
- Socratic proofs for quantifiers
- The Taming of the Cut. Classical Refutations with Analytic Cut
- Automatic proof generation in an axiomatic system for $\mathsf{CPL}$ by means of the method of Socratic proofs
- Shortcuts and dynamic marking in the tableau method for adaptive logics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
