Functional Completeness in CPL via Correspondence Analysis

DOI10.18778/0138-0680.48.1.04MaRDI QIDQ5241402zbMATH OpenOpenAlexFDO

Authors Dorota Leszczyńska-Jasion, Vasilyi Shangin, Marcin Jukiewicz, Yaroslav I. Petrukhin

Publication date 31 October 2019

Published in Bulletin of the Section of Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.18778/0138-0680.48.1.04

zbMATH Keywords

automated deductionautomated rules generationclassical propositional logiccorrespondence analysisfunctional completenessinvertible rulessequent calculus

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 59234
• A GENERALISATION OF SLUPECKI'S CRITERION FOR FUNCTIONAL COMPLETENESS
• A COMPLETENESS THEOREM FOR CORRELATION LATTICES
• A functional approach to prove complementarity
• A category-theoretic characterization of functional completeness
• Completeness of cocompletions
• scientific article; zbMATH DE number 757642
• Functional aspects of the completeness problem for some classes of automaton functions
• A Relationship Between Ordinary Functional Completeness and a Generalisation of the Concept
• Correspondence and Completeness for Generalized Quantifiers

Cites work

• A calculus of antinomics
• A lattice of implicative extensions of regular Kleene's logics
• ARBITRARY TRUTH-VALUE FUNCTIONS AND NATURAL DEDUCTION
• Automated correspondence analysis for the binary extensions of the logic of paradox
• Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis
• Bochvar's three-valued logic and literal paralogics: their lattice and functional equivalence
• Completeness via correspondence for extensions of the logic of paradox
• Correspondence analysis for first degree entailment
• Correspondence analysis for logic of rational agent
• Generalized correspondence analysis for three-valued logics
• scientific article; zbMATH DE number 3659568 (Why is no real title available?)
• scientific article; zbMATH DE number 46359 (Why is no real title available?)
• scientific article; zbMATH DE number 1497485 (Why is no real title available?)
• scientific article; zbMATH DE number 6418709 (Why is no real title available?)
• scientific article; zbMATH DE number 3061149 (Why is no real title available?)
• Intuitive semantics for first-degree entailments and `coupled trees'
• Logical constants as punctuation marks
• Natural three-valued logics characterized by natural deduction
• On paraconsistent weak Kleene logic: axiomatisation and algebraic analysis
• Rational agency from a truth-functional perspective
• Rule-Generation Theorem and its Applications
• Structural proof theory. With an appendix by Aarne Ranta
• The logic of paradox

Cited in

(4)

• Two-sided sequent calculi for \textit{FDE}-like four-valued logics
• The method of Socratic proofs meets correspondence analysis
• Non-transitive correspondence analysis
• Correspondence analysis for some fragments of classical propositional logic

Describes a project that uses

Uses Software

• Pesca

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241402)