AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX

DOI10.1017/S1755020317000156zbMath1387.03009OpenAlexW2726482532MaRDI QIDQ4600826

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

proof theorynatural deductioncorrespondence analysisproof searchnon-classical logiclogic of paradox

Mathematics Subject Classification ID

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

Related Items (11)

Correspondence analysis for some fragments of classical propositional logic ⋮ Generalized correspondence analysis for three-valued logics ⋮ Natural deduction for Post's logics and their duals ⋮ Correspondence analysis and automated proof-searching for first degree entailment ⋮ Unnamed Item ⋮ Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values ⋮ 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 ⋮ Exactly true and non-falsity logics meeting infectious ones ⋮ Normalisation for Some Quite Interesting Many-Valued Logics

Cites Work

• Logic of paradox revisited
• On an implication connective of RM
• Investigations into the system of intuitionistic logic
• The logic of paradox
• Handbook of philosophical logic. Vol. 6
• A calculus of antinomics
• Logic of antinomies
• A propositional calculus for inconsistent deductive systems
• On the logics related to A. Arruda’s system V1
• Formal inconsistency and evolutionary databases
• Natural Deduction Calculus for Linear-Time Temporal Logic
• Natural 3-valued logics—characterization and proof theory
• 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
• A Lattice of Implicative Extensions of Regular Kleene's Logics
• On notation for ordinal numbers
• Handbook of philosophical logic. Vol. 2.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX