scientific article; zbMATH DE number 6418709
From MaRDI portal
Publication:4982110
Recommendations
- Generalized correspondence analysis for three-valued logics
- Some remarks on A. Tamminga's paper ``Correspondence analysis for strong three-valued logic
- Strong Three-Valued Paraconsistent Logics
- A Correspondence Between Variable Relations And Three-Valued Propositional Logic
- A map of dependencies among three-valued logics
- Corrigendum to: ``A map of dependencies among three-valued logics
- Relationships between Connectives in Three-Valued Logics
- scientific article; zbMATH DE number 1775473
- Correspondence analysis for some fragments of classical propositional logic
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
- 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
- Some remarks on A. Tamminga's paper ``Correspondence analysis for strong three-valued logic
- Automated correspondence analysis for the binary extensions of the logic of paradox
- Generalisation of proof simulation procedures for Frege systems by M. L. Bonet and S. R. Buss
- Natural deduction for three-valued regular logics
- Natural Deduction for Four-Valued both Regular and Monotonic Logics
- A Correspondence Between Variable Relations And Three-Valued Propositional Logic
- Completeness via correspondence for extensions of the logic of paradox
- Natural deduction for Yuriev's logic
- 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
- Non-transitive correspondence analysis
- Paracomplete truth theory with a definable hierarchy of determinateness operators
- Editorial introduction
- Resolving Radzki’s issues with Łukasiewicz logics’ axiomatics via correspondence analysis
- Correspondence analysis for some fragments of classical propositional logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982110)
