Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
propositional formulas
|
| gptkbp:category |
proof theory
|
| gptkbp:field |
gptkb:logic
|
| https://www.w3.org/2000/01/rdf-schema#label |
Glivenko's theorem
|
| gptkbp:namedAfter |
gptkb:Valery_Glivenko
|
| gptkbp:relatedTo |
gptkb:classical_logic
intuitionistic logic |
| gptkbp:state |
A propositional formula is provable in classical logic if and only if its double negation is provable in intuitionistic logic.
|
| gptkbp:yearProposed |
1929
|
| gptkbp:bfsParent |
gptkb:Valery_Glivenko
|
| gptkbp:bfsLayer |
6
|