Correspondence analysis for some fragments of classical propositional logic

DOI10.1007/S11787-021-00267-4zbMath1477.03021OpenAlexW3127846988MaRDI QIDQ828774

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

zbMATH Keywords

natural deductioncorrespondence analysisclassical logicdisjunction fragmentimplication fragmentnegation fragment

Mathematics Subject Classification ID

Classical propositional logic (03B05) Abstract deductive systems (03B22)

Related Items (2)

Non-transitive correspondence analysis ⋮ Two-sided sequent calculi for \textit{FDE}-like four-valued logics

Uses Software

• Pesca

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive negations and paraconsistency
• The logic of paradox
• Generalized correspondence analysis for three-valued logics
• Intuitive semantics for first-degree entailments and `coupled trees'
• A calculus of antinomics
• 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
• Classic-Like Analytic Tableaux for Finite-Valued Logics
• Brief study of G'₃ logic
• Natural 3-valued logics—characterization and proof theory
• 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
• Finitely many-valued logics and natural deduction
• Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis
• 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
• On notation for ordinal numbers

This page was built for publication: Correspondence analysis for some fragments of classical propositional logic