Functional Completeness in CPL via Correspondence Analysis

DOI10.18778/0138-0680.48.1.04zbMath1477.03244OpenAlexW2972197167MaRDI QIDQ5241402

Marcin Jukiewicz, Vasilyi Shangin, Dorota Leszczyńska-Jasion, 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.1.04

zbMATH Keywords

sequent calculusclassical propositional logiccorrespondence analysisfunctional completenessautomated deductioninvertible rulesautomated rules generation

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05) Structure of proofs (03F07) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (4)

Correspondence analysis for some fragments of classical propositional logic ⋮ Non-transitive correspondence analysis ⋮ Two-sided sequent calculi for \textit{FDE}-like four-valued logics ⋮ The Method of Socratic Proofs Meets Correspondence Analysis

Uses Software

• Pesca

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On paraconsistent weak Kleene logic: axiomatisation and algebraic analysis
• Logical constants as punctuation marks
• The logic of paradox
• Generalized correspondence analysis for three-valued logics
• Intuitive semantics for first-degree entailments and `coupled trees'
• A calculus of antinomics
• ARBITRARY TRUTH-VALUE FUNCTIONS AND NATURAL DEDUCTION
• 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
• Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis
• A Lattice of Implicative Extensions of Regular Kleene's Logics
• Rule-Generation Theorem and its Applications

This page was built for publication: Functional Completeness in CPL via Correspondence Analysis