Completeness via correspondence for extensions of the logic of paradox
From MaRDI portal
Recommendations
- Automated correspondence analysis for the binary extensions of the logic of paradox
- Generalized correspondence analysis for three-valued logics
- Correspondence analysis for first degree entailment
- scientific article; zbMATH DE number 6418709
- Correspondence analysis and automated proof-searching for first degree entailment
Cites work
Cited in
(28)- Generalized correspondence analysis for three-valued logics
- The natural deduction systems for the three-valued nonsense logics Z and E
- Natural deduction for Post's logics and their duals
- Natural deduction for Fitting's four-valued generalizations of Kleene's logics
- A class of implicative expansions of Kleene's strong logic, a subclass of which is shown functionally complete via the precompleteness of Łukasiewicz's 3-valued logic Ł3
- Deduction normalization theorem for Sette's logic and its modifications
- Natural deduction system for three-valued Heyting's logic
- Correspondence analysis and automated proof-searching for first degree entailment
- Two-sided sequent calculi for \textit{FDE}-like four-valued logics
- Variations on the collapsing lemma
- Automated correspondence analysis for the binary extensions of the logic of paradox
- Natural deduction for three-valued regular logics
- Natural Deduction for Four-Valued both Regular and Monotonic Logics
- 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
- Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation
- 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
- scientific article; zbMATH DE number 6287581 (Why is no real title available?)
- Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values
- Non-transitive correspondence analysis
- Editorial introduction
- Normalisation for some infectious logics and their relatives
- Resolving Radzki’s issues with Łukasiewicz logics’ axiomatics via correspondence analysis
- Gates and circuits via Dunn semantics
- Correspondence analysis for some fragments of classical propositional logic
This page was built for publication: Completeness via correspondence for 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 Q4899968)
