Non-transitive correspondence analysis (Q6156626): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: UNSOUND INFERENCES MAKE PROOFS SHORTER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite-valued propositional logical calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of antinomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-valued Calculi for Logics Based on Non-determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-free sequent calculi for C-systems with generalized finite-valued semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A RECOVERY OPERATOR FOR NONTRANSITIVE APPROACHES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Three-Valued Paraconsistent Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics of Formal Inconsistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal inconsistency and evolutionary databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Taming of the Cut. Classical Refutations with Analytic Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositions in Prepositional Logic Provable Only by Indirect Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4822151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4678353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lvov-Warsaw school. Past and present / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural deduction, hybrid systems and modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-matrix logic as a paraconsistent logic for dubitable information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substructural logics with mingle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal semantics without possible worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / 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: Q4025003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence analysis for some fragments of classical propositional logic / 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: On the ‘transitivity’ of consequence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952081 / 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: Q4777260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4982110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Non-transitive “Identity” / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust non-transitive logic / rank
 
Normal rank

Revision as of 08:33, 1 August 2024

scientific article; zbMATH DE number 7695701
Language Label Description Also known as
English
Non-transitive correspondence analysis
scientific article; zbMATH DE number 7695701

    Statements

    Non-transitive correspondence analysis (English)
    0 references
    0 references
    0 references
    14 June 2023
    0 references
    proof theory
    0 references
    correspondence analysis
    0 references
    natural deduction
    0 references
    non-transitive logic
    0 references
    three-valued logic
    0 references
    trivalent logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers