Completeness and decidability results for CTL in constructive type theory (Q287375): 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.1007/s10817-016-9361-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2293203053 / rank | |||
Normal rank | |||
Latest revision as of 22:45, 19 March 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
