Completeness and decidability results for CTL in constructive type theory (Q287375)
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: Completeness and decidability results for CTL in constructive type theory |
scientific article; zbMATH DE number 6585637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness and decidability results for CTL in constructive type theory |
scientific article; zbMATH DE number 6585637 |
Statements
Completeness and decidability results for CTL in constructive type theory (English)
0 references
26 May 2016
0 references
computation tree logic (CTL)
0 references
Hilbert axiomatizations
0 references
completeness
0 references
decidability
0 references
Coq
0 references
Ssreflect
0 references
constructive proofs
0 references
interactive theorem proving
0 references
0 references
0 references
0 references
0.9404728412628174
0 references
0.7826952934265137
0 references
0.7789663672447205
0 references
0.7685640454292297
0 references
0.7685640454292297
0 references
