Correspondence analysis for some fragments of classical propositional logic (Q828774): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A calculus of antinomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural 3-valued logics—characterization and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classic-Like Analytic Tableaux for Finite-Valued Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely many-valued logics and natural deduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitive semantics for first-degree entailments and `coupled trees' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-Search in Natural Deduction Calculus for Classical Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On notation for ordinal numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLETENESS VIA CORRESPONDENCE FOR EXTENSIONS OF THE LOGIC OF PARADOX / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Completeness in CPL via Correspondence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Method of Socratic Proofs Meets Correspondence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive negations and paraconsistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief study of G'<sub>3</sub> logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5240589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence analysis and automated proof-searching for first degree entailment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized correspondence analysis for three-valued logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The logic of paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARBITRARY TRUTH-VALUE FUNCTIONS AND NATURAL DEDUCTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Precise Definition of an Inference (by the Example of Natural Deduction Systems for Logics $I_{\langle \alpha,\beta \rangle}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4982110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lattice of Implicative Extensions of Regular Kleene's Logics / rank
 
Normal rank

Revision as of 16:36, 25 July 2024

scientific article
Language Label Description Also known as
English
Correspondence analysis for some fragments of classical propositional logic
scientific article

    Statements

    Correspondence analysis for some fragments of classical propositional logic (English)
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    The authors deal with the implication, disjunction, and negation fragments of classical propositional logic, particularly with an application of correspondence analysis to some connectiveless fragment with certain basic properties of the logical consequence relation. A sound and complete natural deduction system for any binary extension of each fragment in question is obtained. Segerberg's systems for connectiveless and negation fragments are discussed and compared with introduced systems, as well.
    0 references
    classical logic
    0 references
    correspondence analysis
    0 references
    disjunction fragment
    0 references
    implication fragment
    0 references
    negation fragment
    0 references
    natural deduction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers