Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Blackburn, J. Benthem (2007)
Modal logic: a semantic perspective
O. Roy, V. Hendricks, C. Roy (2010)
Epistemic logic : 5 questions
(1984)
Intuitionistic double negation as a necessity operator
IL (triple-negation law)
(2011)
Logic without Frontiers: Festschrift for Walter Alexandre Carnielli on the occasion of his 60th birthday
For 52, consider the in fact stronger-thannecessary proof of 38
Sergei Artëmov (2008)
THE LOGIC OF JUSTIFICATIONThe Review of Symbolic Logic, 1
P. Blackburn, J. Benthem, F. Wolter (2007)
Handbook of Modal Logic, 3
Valeria Paiva, Eike Ritter (2011)
Basic Constructive Modality
LIiP ¬¬(CM k M ) CMMC
(1995)
What Is a Logical System? Number 4 in Studies in Logic and Computation
CM k M ∧ φ)) definition 2
Kurt Ranalter (2010)
Embedding Constructive K into Intuitionistic K
(2014)
ACM Transactions on Computational Logic
φ → φ )) → M ± CM φ ) ∧ M ∓ CM (φ → φ )) 1, IL 3
G. Steren, E. Bonelli (2013)
Intuitionistic Hypothetical Logic of Proofs
D. Wijesekera (1990)
Constructive Modal Logics IAnn. Pure Appl. Log., 50
Yuri Gureoich (2008)
Intuitionistic Logic
S. Feferman (2005)
The Number Systems: Foundations of Algebra and Analysis
LIiP M ± CM CM k M self-knowledge
LIiP ¬¬(φ ∧ ¬φ) → (φ ∧ ¬φ) 2, 6
D. Gollmann (2010)
Computer securityWiley Interdisciplinary Reviews: Computational Statistics, 2
M ± CM φ) ↔ φ) ET bis
of Intuitionistic Interactive Proofs 35:31 ACKNOWLEDGMENTS I thank Olga Grinchtein for spotting a few typos
Perlman Kaufman
Security Engineering: a Guide to Building Dependable Distributed Systems
(2013)
Logic of intuitionistic interactive proofs (formal theory of disjunctive knowledge transfer). Short paper presented at the Congress on Logic and Philosophy of Science
C. Areces, B. Cate (2007)
Hybrid logics
Ronald Fagin (1995)
Reasoning about knowledge
P. Hrubes (2007)
A lower bound for intuitionistic logicAnn. Pure Appl. Log., 146
P. Taylor (1999)
Practical Foundations of Mathematics, 59
Saul Kripke (1965)
Semantical Analysis of Intuitionistic Logic IStudies in logic and the foundations of mathematics, 40
Konstantinos Pouliasis, G. Primiero (2013)
J-Calc: A Typed Lambda Calculus for Intuitionistic Justification Logic
S. Kramer (2012)
Logic of Negation-Complete Interactive Proofs (Formal Theory of Epistemic Deciders)
(1995)
editor
J. Benthem (1996)
Modal Logic as a Theory of Information
A. Baskar, R. Ramanujam, S. Suresh (2010)
A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
J. Meyer, F. Veltman (2007)
Intelligent agents and common sense reasoning
N. Ferguson, B. Schneier, Tadayoshi Kohno (2010)
Cryptography Engineering - Design Principles and Practical Applications
→ (φ ∧ ¬φ)) IL (reductio ad absurdum) 3
Markus Frick, Martin Grohe (2002)
The complexity of first-order and monadic second-order logic revisitedProceedings 17th Annual IEEE Symposium on Logic in Computer Science
For 37, consider that
S. Kramer (2012)
A Logic of Interactive Proofs (Formal Theory of Knowledge Transfer)arXiv: Logic in Computer Science
J. Benthem (2009)
The information in intuitionistic logicSynthese, 167
A. Simpson (1994)
The proof theory and semantics of intuitionistic modal logic
Alwen Tiu, R. Goré (2008)
A Proof Theoretic Analysis of Intruder Theories
M. Fitting (2007)
Modal proof theory
For 58, consider that: 1. LIiP (M ∓ CM φ) → ¬¬φ EWDN 2
R. Statman (1979)
Intuitionistic Propositional Logic is Polynomial-Space CompleteTheor. Comput. Sci., 9
Emil Jeřábek (2008)
Independent Bases of Admissible RulesLog. J. IGPL, 16
(1984)
Axiomatisations for some intuitionistic modal logics. Rendiconti del seminario matematico del Politecnico di Torino
Y. Moschovakis (1994)
Notes On Set Theory
J. Crossley, M. Dummett (1963)
Formal Systems and Recursive Functions
S. Kramer (2012)
Logic of Non-monotonic Interactive Proofs
(1984)
Publications de l’Institut Mathématique (Beograd)
S. Kramer (2012)
Logic of Non-Monotonic Interactive Proofs (Formal Theory of Temporary Knowledge Transfer)ArXiv, abs/1208.1842
(2008)
Lambda-Calculus and Combinators (2nd ed.)
→ (φ ∨ φ )) of ET bis, and that LIiP (φ ∨ φ ) → ((M ± CM φ) ∨ M ± CM φ ) by MM. Hence LIiP CM For 41, consider 27 and 40. For 42, consider that: 1
V. Goranko, M. Otto (2007)
Model theory of modal logic
Sergei Artëmov, Rosalie Iemhoff (2007)
The basic intuitionistic logic of proofsJournal of Symbolic Logic, 72
P. Blackburn, J. Benthem, F. Wolter (2006)
Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning)
G. Plotkin, C. Stirling (1988)
A Framework for Intuitionistic Modal Logics
Christopher Menzel (2000)
Logic and Reality: Essays on the Legacy of Arthur PriorThe Philosophical Review, 109
Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer) SIMON KRAMER, SK-R&D LLC (Switzerland) We produce a decidable super-intuitionistic normal modal logic of internalised intuitionistic (and thus disjunctive and monotonic) interactive proofs (LIiP) from an existing classical counterpart of classical monotonic non-disjunctive interactive proofs (LiP). Intuitionistic interactive proofs effect a durable epistemic impact in the possibly adversarial communication medium CM (which is imagined as a distinguished agent) and only in that, that consists in the permanent induction of the perfect and thus disjunctive knowledge of their proof goal by means of CM's knowledge of the proof: If CM knew my proof then CM would persistently and also disjunctively know that my proof goal is true. So intuitionistic interactive proofs effect a lasting transfer of disjunctive propositional knowledge (disjunctively knowable facts) in the communication medium of multiagent distributed systems via the transmission of certain individual knowledge (knowable intuitionistic proofs). Our (necessarily) CM-centred notion of proof is also a disjunctive explicit refinement of KD45-belief, and yields also such a refinement of standard S5-knowledge. Monotonicity but not communality is a commonality of LiP, LIiP, and their internalised notions of proof. As a side-effect, we offer a short internalised proof
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Sep 17, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.