A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic (Q3097870): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:49, 3 February 2024
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
