Correspondence analysis for some fragments of classical propositional logic
type: Item
instance of: scholarly article
title: Correspondence analysis for some fragments of classical propositional logic
zbMATH Open document ID: 1477.03021
author: Vasilyi Shangin
author: Yaroslav I. Petrukhin
published in: Logica Universalis
publication date: 2021-05-05T00:00:00Z
review text: The authors deal with the implication, disjunction, and negation fragments of classical propositional logic, particularly with an application of correspondence analysis to some connectiveless fragment with certain basic properties of the logical consequence relation. A sound and complete natural deduction system for any binary extension of each fragment in question is obtained. Segerberg's systems for connectiveless and negation fragments are discussed and compared with introduced systems, as well.
Mathematics Subject Classification ID: 03B05
Mathematics Subject Classification ID: 03B22
zbMATH DE Number: 7344023
zbMATH Keywords: classical logic
zbMATH Keywords: correspondence analysis
zbMATH Keywords: disjunction fragment
zbMATH Keywords: implication fragment
zbMATH Keywords: negation fragment
zbMATH Keywords: natural deduction
reviewed by: Branislav Boričić
describes a project that uses: Pesca
MaRDI profile type: Publication
full work available at URL: s11787-021-00267-4
OpenAlex ID: W3127846988
cites work: A calculus of antinomics
cites work: Natural 3-valued logics—characterization and proof theory
cites work: Q3206928
cites work: Classic-Like Analytic Tableaux for Finite-Valued Logics
cites work: Finitely many-valued logics and natural deduction
cites work: Intuitive semantics for first-degree entailments and `coupled trees'
cites work: Proof-Search in Natural Deduction Calculus for Classical Propositional Logic
cites work: Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence
cites work: On notation for ordinal numbers
cites work: COMPLETENESS VIA CORRESPONDENCE FOR EXTENSIONS OF THE LOGIC OF PARADOX
cites work: Functional Completeness in CPL via Correspondence Analysis
cites work: The Method of Socratic Proofs Meets Correspondence Analysis
cites work: Q4229041
cites work: Structural proof theory. With an appendix by Aarne Ranta
cites work: Constructive negations and paraconsistency
cites work: Brief study of G'3 logic
cites work: AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX
cites work: Q5240589
cites work: Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis
cites work: Correspondence analysis and automated proof-searching for first degree entailment
cites work: Generalized correspondence analysis for three-valued logics
cites work: The logic of paradox
cites work: ARBITRARY TRUTH-VALUE FUNCTIONS AND NATURAL DEDUCTION
cites work: A Precise Definition of an Inference (by the Example of Natural Deduction Systems for Logics $I_{\langle \alpha,\beta \rangle}$
cites work: Q4982110
cites work: A Lattice of Implicative Extensions of Regular Kleene's Logics
DOI: 10.1007/S11787-021-00267-4
description: scientific article; zbMATH DE number 7344023