The Method of Socratic Proofs Meets Correspondence Analysis
From MaRDI portal
Publication:5241406
DOI10.18778/0138-0680.48.2.02zbMath1477.03100OpenAlexW2974146772WikidataQ113729588 ScholiaQ113729588MaRDI QIDQ5241406
Dorota Leszczyńska-Jasion, Vasilyi Shangin, Yaroslav I. Petrukhin
Publication date: 31 October 2019
Published in: Bulletin of the Section of Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.18778/0138-0680.48.2.02
sequent calculusclassical propositional logiccorrespondence analysisinferential erotetic logicSocratic proofsinvertible rule
Related Items
Correspondence analysis for some fragments of classical propositional logic, Non-transitive correspondence analysis
Cites Work
- On paraconsistent weak Kleene logic: axiomatisation and algebraic analysis
- Handbook of philosophical logic. Vol. 8
- Socratic proofs and paraconsistency: A case study
- Dual erotetic calculi and the minimal \(\mathsf{LFI}\)
- The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G.
- The logic of paradox
- Generalized correspondence analysis for three-valued logics
- Intuitive semantics for first-degree entailments and `coupled trees'
- Socratic proofs
- Socratic proofs for quantifiers
- A calculus of antinomics
- AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX
- Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence
- COMPLETENESS VIA CORRESPONDENCE FOR EXTENSIONS OF THE LOGIC OF PARADOX
- Rational agency from a truth-functional perspective
- Functional Completeness in CPL via Correspondence Analysis
- Automatic proof generation in an axiomatic system for $\mathsf{CPL}$ by means of the method of Socratic proofs
- A Lattice of Implicative Extensions of Regular Kleene's 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
