Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion (Q830398): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1007/s10992-020-09553-w / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10992-020-09553-W / rank
 
Normal rank

Revision as of 10:20, 9 December 2024

scientific article
Language Label Description Also known as
English
Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion
scientific article

    Statements

    Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion (English)
    0 references
    0 references
    7 May 2021
    0 references
    Nelson's paraconsistent four-valued logic N4
    0 references
    Wansing's basic constructive connexive logic C
    0 references
    Arieli
    0 references
    Avron
    0 references
    and Zamansky's ideal paraconistent four-valued logic 4CC
    0 references
    Kripke-completeness theorem
    0 references
    cut-elimination theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references