Correspondence analysis for some fragments of classical propositional logic
From MaRDI portal
Publication:828774
DOI10.1007/S11787-021-00267-4zbMATH Open1477.03021OpenAlexW3127846988MaRDI QIDQ828774FDOQ828774
Authors: Vasilyi Shangin, Yaroslav I. Petrukhin
Publication date: 5 May 2021
Published in: Logica Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11787-021-00267-4
Recommendations
- Generalized correspondence analysis for three-valued logics
- Correspondence analysis for logic of rational agent
- Automated correspondence analysis for the binary extensions of the logic of paradox
- scientific article; zbMATH DE number 6418709
- Correspondence analysis and automated proof-searching for first degree entailment
correspondence analysisnatural deductionclassical logicdisjunction fragmentimplication fragmentnegation fragment
Cites Work
- The logic of paradox
- Structural proof theory. With an appendix by Aarne Ranta
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intuitive semantics for first-degree entailments and `coupled trees'
- On notation for ordinal numbers
- Natural 3-valued logics—characterization and proof theory
- Constructive negations and paraconsistency
- Brief study of G'3 logic
- Classic-Like Analytic Tableaux for Finite-Valued Logics
- A calculus of antinomics
- Finitely many-valued logics and natural deduction
- Generalized correspondence analysis for three-valued logics
- Correspondence analysis and automated proof-searching for first degree entailment
- ARBITRARY TRUTH-VALUE FUNCTIONS AND NATURAL DEDUCTION
- Proof-Search in Natural Deduction Calculus for Classical Propositional Logic
- 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
- Title not available (Why is that?)
- Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis
- Natural three-valued logics characterized by natural deduction
- Functional Completeness in CPL via Correspondence Analysis
- The method of Socratic proofs meets correspondence analysis
- A precise definition of an inference (by the example of natural deduction systems for logics \(I_{\langle \alpha, \beta\rangle}\))
- A lattice of implicative extensions of regular Kleene's logics
Cited In (8)
- Generalized correspondence analysis for three-valued logics
- Non-transitive correspondence analysis
- Man muss immer umkehren!
- Correia semantics revisited
- Correspondence analysis for logic of rational agent
- Two-sided sequent calculi for \textit{FDE}-like four-valued logics
- A logical study of the correspondence relation
- Title not available (Why is that?)
Uses Software
This page was built for publication: Correspondence analysis for some fragments of classical propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828774)