Completeness and decidability results for CTL in constructive type theory (Q287375): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Coq/SSReflect / rank | |||
Normal rank | |||
Revision as of 07:58, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completeness and decidability results for CTL in constructive type theory |
scientific article |
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
