Results
eNauka >
Results >
Discrete linear-time probabilistic logics: Completeness, decidability and complexity
| Title: | Discrete linear-time probabilistic logics: Completeness, decidability and complexity | Authors: | Ognjanović, Zoran   |
Issue Date: | 2006 | Publication: | Journal of Logic and Computation | ISSN: | 0955-792X Journal of Logic and Computation Search Idenfier |
Publisher: | Oxford University Press | Type: | Article | Collation: | vol. 16 br. 2 str. 257-285 | DOI: | 10.1093/logcom/exi077 | WoS-ID: | 000236613800006 | Scopus-ID: | 2-s2.0-33645735519 | URI: | https://enauka.gov.rs/handle/123456789/577598 http://researchrepository.mi.sanu.ac.rs/handle/123456789/72 |
M-category: | 22M22 |
37
SCOPUSTM
26
OpenCitations
33
WEB OF SCIENCETM
Altmetric
Dimensions
Unpaywall
Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.