A probabilistic temporal epistemic logic: strong completeness

DOI10.1093/JIGPAL/JZAC072MaRDI QIDQ6639560zbMATH OpenFDO

Authors Zoran Ognjanović, Angelina Ilić-Stepić, Aleksandar Perović

Publication date 15 November 2024

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/JIGPAL/JZAC072

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol
• Probabilistic consensus of the blockchain protocol
• A strong completeness result for a MAS logic
• A First-order Logic for Reasoning about Knowledge and Probability
• A probabilistic temporal epistemic logic: decidability

Cited in

(3)

• Probabilistic consensus of the blockchain protocol
• A logic of blockchain updates
• Logics for at most countable first-order structures

This page was built for publication: A probabilistic temporal epistemic logic: strong completeness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639560)