Automated correspondence analysis for the binary extensions of the logic of paradox

DOI10.1017/S1755020317000156MaRDI QIDQ4600826zbMATH OpenOpenAlexFDO

Authors Vasilyi Shangin, Yaroslav I. Petrukhin

Publication date 17 January 2018

Published in The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1755020317000156

zbMATH Keywords

correspondence analysislogic of paradoxnatural deductionnon-classical logicproof searchproof theory

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50) Paraconsistent logics (03B53)

Recommendations

• Completeness via correspondence for extensions of the logic of paradox
• Generalized correspondence analysis for three-valued logics
• Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis
• Correspondence analysis and automated proof-searching for first degree entailment
• Subprevarieties versus extensions. Application to the logic of paradox

Cites work

• A calculus of antinomics
• A lattice of implicative extensions of regular Kleene's logics
• A propositional calculus for inconsistent deductive systems
• A syntactic characterization of Kleene's strong connectives with two designated values
• 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
• Erratum to: ``Natural implication and modus ponens principle
• Formal inconsistency and evolutionary databases
• Handbook of philosophical logic. Vol. 2.
• Handbook of philosophical logic. Vol. 6
• scientific article; zbMATH DE number 4132131 (Why is no real title available?)
• scientific article; zbMATH DE number 5822571 (Why is no real title available?)
• scientific article; zbMATH DE number 4137750 (Why is no real title available?)
• scientific article; zbMATH DE number 5519286 (Why is no real title available?)
• scientific article; zbMATH DE number 3719121 (Why is no real title available?)
• scientific article; zbMATH DE number 3777462 (Why is no real title available?)
• scientific article; zbMATH DE number 45458 (Why is no real title available?)
• scientific article; zbMATH DE number 3499717 (Why is no real title available?)
• scientific article; zbMATH DE number 3504935 (Why is no real title available?)
• scientific article; zbMATH DE number 596497 (Why is no real title available?)
• scientific article; zbMATH DE number 753774 (Why is no real title available?)
• scientific article; zbMATH DE number 3453564 (Why is no real title available?)
• scientific article; zbMATH DE number 6418709 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• scientific article; zbMATH DE number 3315182 (Why is no real title available?)
• scientific article; zbMATH DE number 3335866 (Why is no real title available?)
• scientific article; zbMATH DE number 3392404 (Why is no real title available?)
• scientific article; zbMATH DE number 3077773 (Why is no real title available?)
• Investigations into the system of intuitionistic logic
• Logic of antinomies
• Logic of paradox revisited
• Natural 3-valued logics—characterization and proof theory
• Natural Deduction Calculus for Linear-Time Temporal Logic
• Natural derivations for Priest, an introduction to non-classical logic
• Natural implication and modus ponens principle
• On an implication connective of RM
• On notation for ordinal numbers
• On the logics related to A. Arruda’s system V1
• The logic of paradox

Cited in

(19)

• Saving the truth schema from paradox
• Generalized correspondence analysis for three-valued logics
• Natural deduction for Post's logics and their duals
• Level logics
• Correspondence analysis and automated proof-searching for first degree entailment
• Man muss immer umkehren!
• Reassurance for the logic of paradox
• scientific article; zbMATH DE number 3920445 (Why is no real title available?)
• Completeness via correspondence for extensions of the logic of paradox
• Exactly true and non-falsity logics meeting infectious ones
• Correspondence analysis for logic of rational agent
• Natural deduction systems for some modifications of Kleene's and Dunn-Belnap's logics
• Normalisation for some quite interesting many-valued logics
• 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
• Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values
• On enumerating models for the logic of paradox using tableau
• Correspondence analysis for some fragments of classical propositional logic

This page was built for publication: Automated correspondence analysis for the binary extensions of the logic of paradox

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