Theoretical Computer Science
The foundation of a generic theorem prover
Journal of Automated Reasoning
A framework for defining logics
Journal of the ACM (JACM)
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Basic proof theory
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Information and Computation
Information and Computation
Proving termination with multiset orderings
Communications of the ACM
Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
A Non-commutative Extension of Classical Linear Logic
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Using Linear Logic to Reason about Sequent Systems
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Non-commutativity and MELL in the Calculus of Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Specifying Theorem Provers in a Higher-Order Logic Programming Language
Proceedings of the 9th International Conference on Automated Deduction
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Canonical Propositional Gentzen-Type Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A system of interaction and structure
ACM Transactions on Computational Logic (TOCL)
From Axioms to Analytic Rules in Nonclassical Logics
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Algorithmic specifications in linear logic with subexponentials
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Journal of Automated Reasoning
Specifying Proof Systems in Linear Logic with Subexponentials
Electronic Notes in Theoretical Computer Science (ENTCS)
On the specification of sequent systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Two-Level Logic Approach to Reasoning About Computations
Journal of Automated Reasoning
| Hi-index | 5.23 |
Intuitionistic logic and intuitionistic type systems are commonly used as frameworks for the specification of natural deduction proof systems. In this paper we show how to use classical linear logic as a logical framework to specify sequent calculus proof systems and to establish some simple consequences of the specified sequent calculus proof systems. In particular, derivability of an inference rule from a set of inference rules can be decided by bounded (linear) logic programming search on the specified rules. We also present two simple and decidable conditions that guarantee that the cut rule and non-atomic initial rules can be eliminated.