Generalized correspondence analysis for three-valued logics

DOI10.1007/S11787-018-0212-9zbMATH Open1435.03047OpenAlexW2895942613WikidataQ129108411 ScholiaQ129108411MaRDI QIDQ1632053FDOQ1632053

Authors: Yaroslav I. Petrukhin 

Publication date: 12 December 2018

Published in: Logica Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11787-018-0212-9

Recommendations

• scientific article; zbMATH DE number 6418709
• Completeness via correspondence for extensions of the logic of paradox
• Automated correspondence analysis for the binary extensions of the logic of paradox
• Correspondence analysis for some fragments of classical propositional logic
• scientific article; zbMATH DE number 1775473

zbMATH Keywords

correspondence analysisproof theorynatural deductionparaconsistent logicthree-valued logicparacomplete logic

Mathematics Subject Classification ID

Many-valued logic (03B50) Paraconsistent logics (03B53) Proof theory in general (including proof-theoretic semantics) (03F03) Abstract deductive systems (03B22)

Cites Work

• The logic of paradox
• New directions in paraconsistent logic. Collected papers of the 5th world congress on paraconsistency, WCP, Kolkata, India, February 13--17, 2014
• Anti-intuitionism and paraconsistency
• On the theory of inconsistent formal systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus
• Title not available (Why is that?)
• Logics of formal inconsistency
• Logics of nonsense and Parry systems
• Natural 3-valued logics—characterization and proof theory
• Title not available (Why is that?)
• Formal inconsistency and evolutionary databases
• Brief study of G'₃ logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Natural deduction for Post's logics and their duals
• Stone algebras, conditional events, and three valued logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• A map of dependencies among three-valued logics
• A calculus of antinomics
• A propositional calculus for inconsistent deductive systems
• Title not available (Why is that?)
• On an implication connective of RM
• Logic of antinomies
• Title not available (Why is that?)
• Nonsense logics and their algebraic properties
• Sequent calculi for the classical fragment of Bochvar and Halldén's nonsense logics
• On paraconsistent weak Kleene logic: axiomatisation and algebraic analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximal weakly-intuitionistic logics
• Paraconsistency and Sette's calculus P1
• Some remarks on three-valued logic of J. Lukasiewicz
• On interpretation of inconsistent theories
• The pursuit of an implication for the logics L3A and L3B
• A Routley-Meyer semantics for Gödel 3-valued logic and its paraconsistent counterpart
• Automated correspondence analysis for the binary extensions of the logic of paradox
• Hybridized paracomplete and paraconsistent logics
• Bochvar's three-valued logic and literal paralogics: their lattice and functional equivalence
• Completeness via correspondence for extensions of the logic of paradox
• Title not available (Why is that?)
• Two Genuine 3-Valued Paraconsistent Logics
• Natural three-valued logics characterized by natural deduction
• A precise definition of an inference (by the example of natural deduction systems for logics \(I_{\langle \alpha, \beta\rangle}\))
• A lattice of implicative extensions of regular Kleene's logics
• Natural deduction in a paracomplete setting
• Über Eine Prädikatenlogik mit Partiell Definierten Prädikaten und Funktionen
• A note on matrices for systems of nonsense-logics
• Title not available (Why is that?)
• The natural deduction systems for the three-valued nonsense logics Z and E
• Conjunction and disjunction in infectious logics
• Natural deduction for Fitting's four-valued generalizations of Kleene's logics
• Natural deduction system for three-valued Heyting's logic
• A weakly-intuitionistic logic \(I1\)
• Non-classical modifications of many-valued matrices of the classical propositional logic. I.
• Correspondence analysis for first degree entailment
• Natural \(p\)-logics
• Literal-paraconsistent and literal-paracomplete matrices
• Functional interdependence of regular Kleene logics
• Title not available (Why is that?)
• The defective conditional in mathematics
• Defining LFIs and LFUs in extensions of infectious logics
• Natural deduction for three-valued regular logics
• Natural Deduction for Four-Valued both Regular and Monotonic Logics
• Rational agency from a truth-functional perspective
• Correspondence analysis for logic of rational agent
• The first law of cubology for the Rubik's Revenge

Cited In (21)

• On paracomplete versions of Jaśkowski's discussive logic
• On the question of the criteria for the paracompleteness of logics
• Logic prizes \textit{et cætera}
• Non-transitive correspondence analysis
• Completeness via correspondence for extensions of the logic of paradox
• Some remarks on A. Tamminga's paper ``Correspondence analysis for strong three-valued logic
• Man muss immer umkehren!
• Automated correspondence analysis for the binary extensions of the logic of paradox
• The method of Socratic proofs meets correspondence analysis
• Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis
• Correia semantics revisited
• Three new genuine five-valued logics intended to model non-trivial concepts
• Correspondence analysis for logic of rational agent
• Normalisation for some quite interesting many-valued logics
• A lattice of the paracomplete calculi
• Correspondence analysis and automated proof-searching for first degree entailment
• Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation
• Correspondence analysis for some fragments of classical propositional logic
• Title not available (Why is that?)
• Functional Completeness in CPL via Correspondence Analysis
• A Correspondence Between Variable Relations And Three-Valued Propositional Logic

This page was built for publication: Generalized correspondence analysis for three-valued logics

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