Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity

Zoran Ognjanovic. Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity. Journal of Logic and Computation, 16(2):257-285, 2006. [doi]

@article{Ognjanovic06,
  title = {Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity},
  author = {Zoran Ognjanovic},
  year = {2006},
  doi = {10.1093/logcom/exi077},
  url = {http://dx.doi.org/10.1093/logcom/exi077},
  tags = {completeness, logic},
  researchr = {https://researchr.org/publication/Ognjanovic06},
  cites = {0},
  citedby = {0},
  journal = {Journal of Logic and Computation},
  volume = {16},
  number = {2},
  pages = {257-285},
}