A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic (Q3097870)

From MaRDI portal
Revision as of 19:30, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic
scientific article

    Statements

    A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic (English)
    0 references
    0 references
    0 references
    10 November 2011
    0 references
    0 references
    propositional Gödel logic
    0 references
    hypersequents
    0 references
    strong cut-elimination
    0 references
    completeness
    0 references
    0 references