Propositional logics of overwhelming truth

DOI10.4230/LIPICS.CSL.2025.24MaRDI QIDQ7261432zbMATH OpenFDO

Authors Thibaut Antoine, David Baelde

Publication date 9 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2025.24

zbMATH Keywords

cryptographymodal logicsequent calculus

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites work

• A cut-free simple sequent calculus for modal logic S5
• A higher-order indistinguishability logic for cryptographic reasoning
• Automated verification of selected equivalences for security protocols
• Computer-Aided Security Proofs for the Working Cryptographer
• CryptHOL: game-based proofs in higher-order logic
• Modal logic
• Probabilistic encryption
• Simple decision procedure for \(\mathbf {S5}\) in standard cut-free sequent calculus
• Simple probabilistic semantics for propositional K, T, B, S4, and S5
• There is a probabilistic semantics for every extension of classical sentence logic
• Towards unconditional soundness: computationally complete symbolic attacker
• Tractable inference systems: an extension with a deducibility predicate

This page was built for publication: Propositional logics of overwhelming truth

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