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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10992-020-09553-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3017308489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructible falsity and inexact predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propositional logic with subjunctive conditionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with logical bilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The value of the four values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5369472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four-valued paradefinite logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal paraconsistent logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4686539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical negation and expansions of Belnap-Dunn logic / 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: What is negation? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic logic with strong negation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trilattice logic: an embedding-based approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding from multilattice logic into classical logic and vice versa / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory of Nelson's paraconsistent logic: a uniform perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5175691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yet another paradefinite logic: The role of conflation1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connexive implication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructible falsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of philosophical logic. Vol. 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truth, Falsehood, Information and Beyond: The American Plan Generalized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some useful 16-valued logics: How a computer network should think / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5813184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The logic of information structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Methodology of Paraconsistent Logic / rank
 
Normal rank

Revision as of 17:27, 25 July 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