A probabilistic temporal epistemic logic: Strong completeness

Logic Journal of the IGPL 32 (1):94-138 (2024)
  Copy   BIBTEX

Abstract

The paper offers a formalization of reasoning about distributed multi-agent systems. The presented propositional probabilistic temporal epistemic logic $\textbf {PTEL}$ is developed in full detail: syntax, semantics, soundness and strong completeness theorems. As an example, we prove consistency of the blockchain protocol with respect to the given set of axioms expressed in the formal language of the logic. We explain how to extend $\textbf {PTEL}$ to axiomatize the corresponding first-order logic.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A Reasoning Method based on Spatio-Temporal.Seyed Ahmad Mirsanei - 2016 - International Journal of Computer and Information Technologies (Ijocit) 4 (1): 27-32..
Introduction to mathematical logic.Michał Walicki - 2012 - Hackensack, NJ: World Scientific.

Analytics

Added to PP
2022-11-03

Downloads
135 (#327,738)

6 months
38 (#225,348)

Historical graph of downloads
How can I increase my downloads?