On the unification of classical, intuitionistic and affine logics

DOI10.1017/S0960129518000403zbMath1456.03101OpenAlexW2897239477MaRDI QIDQ5236553

Chuck Liang

Publication date: 9 October 2019

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129518000403

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Subsystems of classical logic (including intuitionistic logic) (03B20)

Uses Software

• Lolli

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Delimited control operators prove double-negation shift
• Kripke models for classical logic
• A focused approach to combining logics
• On the unity of logic
• Kripke semantics and proof systems for combining intuitionistic logic and classical logic
• A syntactic theory of sequential control
• Logic programming in a fragment of intuitionistic linear logic
• A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
• A new constructive logic: classic logic
• Logic Programming with Focusing Proofs in Linear Logic
• An intuitiomstic completeness theorem for intuitionistic predicate logic
• The finite model property for various fragments of linear logic
• Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics
• Unifying Classical and Intuitionistic Logics for Computational Control
• Typed Dynamic Control Operators for Delimited Continuations
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science