A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic (Q3097870): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/logcom/exp055 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991664539 / rank | |||
Normal rank | |||
Latest revision as of 18:30, 19 March 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
