Depth relevance of some paraconsistent logics (Q1068075): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3032252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Career induction stops here (and here =2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701398 / rank
 
Normal rank

Revision as of 18:47, 14 June 2024

scientific article
Language Label Description Also known as
English
Depth relevance of some paraconsistent logics
scientific article

    Statements

    Depth relevance of some paraconsistent logics (English)
    0 references
    0 references
    1984
    0 references
    A propositional logic is said to satisfy the ''depth-relevance condition'' iff whenever \(A\to B\) is a thesis then A and B share a variable at the same depth of nested occurrences of \(\to\). The paper under review defines a propositional logic DR which is included in the system T of ''ticket entailment'' and includes the system DK of \textit{R. Routley} [Relevance Logic Newsl. 2, 50-89 and 138-174 (1977; Zbl 0435.03005)], and shows that it satisfies the depth-relevance condition.
    0 references
    paraconsistent logics
    0 references
    relevance logics
    0 references
    ticket entailment
    0 references
    DK
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers