On Strong Normalization in Proof-Graphs for Propositional Logic
Abstract
References
Index Terms
- On Strong Normalization in Proof-Graphs for Propositional Logic
Recommendations
Maehara-style modal nested calculi
AbstractWe develop multi-conclusion nested sequent calculi for the fifteen logics of the intuitionistic modal cube between IK and IS5. The proof of cut-free completeness for all logics is provided both syntactically via a Maehara-style translation and ...
Sequentialization for N-Graphs via Sub-N-Graphs
WoLLIC 2014: Proceedings of the 21st International Workshop on Logic, Language, Information, and Computation - Volume 8652Since proof-nets for MLL- were introduced by Girard 1987, several studies have been made on its soundness proof. Bellin & Van de Wiele 1995 produced an elegant proof based on properties of subnets empires and kingdoms and Robinson 2003 proposed a ...
A First-Order Expansion of Artemov and Protopopescu’s Intuitionistic Epistemic Logic
AbstractIntuitionistic epistemic logic by Artemov and Protopopescu (Rev Symb Log 9:266–298, 2016) accepts the axiom “if A, then A is known” (written ) in terms of the Brouwer–Heyting–Kolmogorov interpretation. There are two variants of intuitionistic ...
Comments
Information & Contributors
Information
Published In
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in