A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic (Q3097870)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic |
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
10 November 2011
0 references
propositional Gödel logic
0 references
hypersequents
0 references
strong cut-elimination
0 references
completeness
0 references
