Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity (Q5477458)
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: Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity |
scientific article; zbMATH DE number 5038544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity |
scientific article; zbMATH DE number 5038544 |
Statements
Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity (English)
0 references
3 July 2006
0 references
probabilistic logic
0 references
axiomatization
0 references
decidability
0 references
temporal logic
0 references
0.8463206887245178
0 references
0.820546567440033
0 references
0.8128754496574402
0 references
