Recognizability in pre-Heyting and well-composed logics (Q2003246): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognizable logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable and perceptible logics and varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong decidability and strong recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive negations and paraconsistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculi over minimal logic and nonembeddability of algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly decidable properties of modal and intuitionistic calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissibility of logical inference rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4451641 / rank
 
Normal rank

Latest revision as of 22:20, 19 July 2024

scientific article
Language Label Description Also known as
English
Recognizability in pre-Heyting and well-composed logics
scientific article

    Statements

    Recognizability in pre-Heyting and well-composed logics (English)
    0 references
    0 references
    0 references
    16 July 2019
    0 references
    0 references
    recognizability
    0 references
    strong recognizability
    0 references
    minimal logic
    0 references
    pre-Heyting logic
    0 references
    Johansson algebra
    0 references
    Heyting algebra
    0 references
    superintuitionistic logic
    0 references
    calculus
    0 references
    0 references