Theoretical Computer Science
The foundation of a generic theorem prover
Journal of Automated Reasoning
Elf: a language for logic definition and verified metaprogramming
Proceedings of the Fourth Annual Symposium on Logic in computer science
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
Proceedings of the workshop on Advances in linear logic
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Free Deduction: An Analysis of "Computations" in Classical Logic
Proceedings of the First Russian Conference on Logic Programming
Using Linear Logic to Reason about Sequent Systems
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Specifying Theorem Provers in a Higher-Order Logic Programming Language
Proceedings of the 9th International Conference on Automated Deduction
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
From Axioms to Analytic Rules in Nonclassical Logics
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
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
LJQ: a strongly focused calculus for intuitionistic logic
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
On the specification of sequent systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Incorporating tables into proofs
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Finding unity in computational logic
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
A general proof system for modalities in concurrent constraint programming
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Mathematical practice, crowdsourcing, and social machines
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
Linear logic can be used as a meta-logic to specify a range of object-level proof systems. In particular, we show that by providing different polarizations within a focused proof system for linear logic, one can account for natural deduction (normal and non-normal), sequent proofs (with and without cut), and tableaux proofs. Armed with just a few, simple variations to the linear logic encodings, more proof systems can be accommodated, including proof system using generalized elimination and generalized introduction rules. In general, most of these proof systems are developed for both classical and intuitionistic logics. By using simple results about linear logic, we can also give simple and modular proofs of the soundness and relative completeness of all the proof systems we consider.