Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer)
DOI10.1145/2811263zbMath1367.68282arXiv1309.1328OpenAlexW2051231771WikidataQ114614121 ScholiaQ114614121MaRDI QIDQ5277900
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1328
communication networksinteractive computationproofs as sufficient evidenceintuitionistic modal logicoracle computationinterpreted communicationmultiagent distributed systemsagents as proof-checkersconstructive Kripke-semanticsdisjunctive explicit doxastic and epistemic logic
Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logic of negation-complete interactive proofs (formal theory of epistemic deciders)
- J-Calc: a typed lambda calculus for intuitionistic justification logic
- Intuitionistic hypothetical logic of proofs
- Constructive modal logics. I
- The information in intuitionistic logic
- A lower bound for intuitionistic logic
- Intuitionistic propositional logic is polynomial-space complete
- Logic of Non-monotonic Interactive Proofs
- Embedding Constructive K into Intuitionistic K
- Notes on Set Theory
- THE LOGIC OF JUSTIFICATION
- A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
- The basic intuitionistic logic of proofs
- A Proof Theoretic Analysis of Intruder Theories
This page was built for publication: Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer)