Correspondence analysis and automated proof-searching for first degree entailment
From MaRDI portal
Publication:2663794
\(n\)-sequent systemscorrespondence analysisfirst degree entailmentfour-valued logicnatural deductionordinary sequent calculiproof theoryproof-searching
Mechanization of proofs and logical operations (03B35) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Many-valued logic (03B50) Paraconsistent logics (03B53) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Recommendations
- Automated correspondence analysis for the binary extensions of the logic of paradox
- Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis
- Generalized correspondence analysis for three-valued logics
- Completeness via correspondence for extensions of the logic of paradox
- A natural deduction system for first degree entailment
Cites work
- 40 years of FDE: an introductory overview
- A calculus of antinomics
- A companion to Brady's 4-valued relevant logic BN4: The 4-valued logic of entailment E4
- A lattice of implicative extensions of regular Kleene's logics
- A natural deduction system for first degree entailment
- A new four-valued approach to modal logic
- A precise definition of an inference (by the example of natural deduction systems for logics \(I_{\langle \alpha, \beta\rangle}\))
- A Shell for Generic Interactive Proof Search
- A strong and rich 4-valued modal logic without Łukasiewicz-type paradoxes
- A theory of logical relevance
- An abstract algebraic logic approach to tetravalent modal logics
- An expansion of first-order Belnap-Dunn logic
- An interpretation of Łukasiewicz's 4-valued modal logic
- Anti-intuitionism and paraconsistency
- Automated correspondence analysis for the binary extensions of the logic of paradox
- Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis
- Belnap's Four-Valued Logic and De Morgan Lattices
- Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values
- Bi-facial truth: a case for generalized truth values
- Bochvar's three-valued logic and literal paralogics: their lattice and functional equivalence
- Classical negation and expansions of Belnap-Dunn logic
- Completeness via correspondence for extensions of the logic of paradox
- Correspondence analysis for first degree entailment
- Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics
- Da Costa meets Belnap and Nelson
- Factor semantics for n-valued logics
- First-degree entailment and its relatives
- Four-valued logics \(\mathbf {BD}\) and \(\mathbf {DM4}\): expansions
- Four-valued paradefinite logics
- From paraconsistent logic to dialetheic logic
- Functional Completeness and Axiomatizability within Belnap's Four-Valued Logic and its Expansions
- Generalized correspondence analysis for three-valued logics
- Generalizing functional completeness in Belnap-Dunn logic
- Gentzen and Jaśkowski natural deduction: fundamentally similar but importantly different
- Goal-oriented proof-search in natural deduction for intuitionistic propositional logic
- Handbook of philosophical logic. Vol. 7
- scientific article; zbMATH DE number 4180779 (Why is no real title available?)
- scientific article; zbMATH DE number 3648682 (Why is no real title available?)
- scientific article; zbMATH DE number 4135906 (Why is no real title available?)
- scientific article; zbMATH DE number 5510996 (Why is no real title available?)
- scientific article; zbMATH DE number 3926879 (Why is no real title available?)
- scientific article; zbMATH DE number 3784842 (Why is no real title available?)
- scientific article; zbMATH DE number 16516 (Why is no real title available?)
- scientific article; zbMATH DE number 67849 (Why is no real title available?)
- scientific article; zbMATH DE number 3504935 (Why is no real title available?)
- scientific article; zbMATH DE number 596497 (Why is no real title available?)
- scientific article; zbMATH DE number 2019859 (Why is no real title available?)
- scientific article; zbMATH DE number 3453564 (Why is no real title available?)
- scientific article; zbMATH DE number 837700 (Why is no real title available?)
- scientific article; zbMATH DE number 922613 (Why is no real title available?)
- scientific article; zbMATH DE number 932649 (Why is no real title available?)
- scientific article; zbMATH DE number 6157349 (Why is no real title available?)
- scientific article; zbMATH DE number 6418709 (Why is no real title available?)
- scientific article; zbMATH DE number 3322506 (Why is no real title available?)
- scientific article; zbMATH DE number 2209823 (Why is no real title available?)
- scientific article; zbMATH DE number 2209893 (Why is no real title available?)
- scientific article; zbMATH DE number 4187771 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- scientific article; zbMATH DE number 3073052 (Why is no real title available?)
- scientific article; zbMATH DE number 3082563 (Why is no real title available?)
- Introduction
- Intuitive semantics for first-degree entailments and `coupled trees'
- Investigations into the system of intuitionistic logic
- Logics of formal inconsistency
- Maximal weakly-intuitionistic logics
- Modal semantics without possible worlds
- Natural 3-valued logics—characterization and proof theory
- Natural \(p\)-logics
- Natural deduction for Fitting's four-valued generalizations of Kleene's logics
- Natural Deduction for Four-Valued both Regular and Monotonic Logics
- Natural deduction for three-valued regular logics
- Natural three-valued logics characterized by natural deduction
- Non-classical modifications of many-valued matrices of the classical propositional logic. I.
- Non-classical operations hidden in classical logic
- Normal natural deduction proofs (in classical logic)
- Note on a six-valued extension of three-valued logic
- Nothing but the truth
- On finite-valued propositional logical calculi
- On Vidal's trivalent explanations for defective conditional in mathematics
- On Łukasiewicz's four-valued modal logic
- Partial and paraconsistent three-valued logics
- Peirce's rule in a full natural deduction system
- Proof-Search in Natural Deduction Calculus for Classical Propositional Logic
- Rational agency from a truth-functional perspective
- Reasoning with logical bilattices
- Reduced Routley-Meyer semantics for the logics characterized by natural implicative expansions of Kleene's strong 3-valued matrix
- Strengthening Brady's paraconsistent 4-valued logic BN4 with truth-functional modal operators
- The \textsc{Fmla-Fmla} axiomatizations of the exactly true and non-falsity logics and some of their cousins
- The defective conditional in mathematics
- The logic determined by Smiley's matrix for Anderson and Belnap's first-degree entailment logic
- The logic of paradox
- The logical legacy of Nikolai Vasiliev and modern logic
- The relative efficiency of propositional proof systems
- The Semantics of First Degree Entailment
- The Taming of the Cut. Classical Refutations with Analytic Cut
- The value of the four values
- Theory of effective propositional paraconsistent logics
- Truth and falsehood. An inquiry into generalized logical values
- What is negation?
Cited in
(11)- A variant with the variable-sharing property of Brady's 4-valued implicative expansion BN4 of Anderson and Belnap's logic FDE
- Automated correspondence analysis for the binary extensions of the logic of paradox
- Completeness via correspondence for extensions of the logic of paradox
- Normalisation for some quite interesting many-valued logics
- Belnap-Dunn Semantics for the Variants of BN4 and E4 which Contain Routley and Meyer’s Logic B
- 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
- A class of implicative expansions of Belnap-Dunn logic in which Boolean negation is definable
- Non-transitive correspondence analysis
- Gates and circuits via Dunn semantics
- Correspondence analysis for some fragments of classical propositional logic
This page was built for publication: Correspondence analysis and automated proof-searching for first degree entailment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663794)
