Non-transitive correspondence analysis

DOI10.1007/s10849-022-09382-xMaRDI QIDQ6156626

Yaroslav I. Petrukhin, Vasilyi Shangin

Publication date: 14 June 2023

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

zbMATH Keywords

proof theorynatural deductionthree-valued logiccorrespondence analysisnon-transitive logictrivalent logic

Mathematics Subject Classification ID

Many-valued logic (03B50)

Cites Work

• 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
• Natural deduction, hybrid systems and modal logics
• Correspondence analysis for some fragments of classical propositional logic
• Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
• The logic of paradox
• Substructural logics with mingle
• Generalized correspondence analysis for three-valued logics
• The Lvov-Warsaw school. Past and present
• A robust non-transitive logic
• On finite-valued propositional logical calculi
• A calculus of antinomics
• Correspondence analysis and automated proof-searching for first degree entailment
• Quasi-matrix logic as a paraconsistent logic for dubitable information
• Formal inconsistency and evolutionary databases
• On Non-transitive “Identity”
• ARBITRARY TRUTH-VALUE FUNCTIONS AND NATURAL DEDUCTION
• Modal semantics without possible worlds
• The relative efficiency of propositional proof systems
• The Taming of the Cut. Classical Refutations with Analytic Cut
• Propositions in Prepositional Logic Provable Only by Indirect Proofs
• On the ‘transitivity’ of consequence relations
• UNSOUND INFERENCES MAKE PROOFS SHORTER
• The Complexity of Propositional Proofs
• COMPLETENESS VIA CORRESPONDENCE FOR EXTENSIONS OF THE LOGIC OF PARADOX
• Logics of Formal Inconsistency
• A RECOVERY OPERATOR FOR NONTRANSITIVE APPROACHES
• Functional Completeness in CPL via Correspondence Analysis
• The Method of Socratic Proofs Meets Correspondence Analysis
• Strong Three-Valued Paraconsistent Logics
• Cut-free sequent calculi for C-systems with generalized finite-valued semantics
• Multi-valued Calculi for Logics Based on Non-determinism
• On notation for ordinal numbers

This page was built for publication: Non-transitive correspondence analysis