Using Linear Logic to Reason about Sequent Systems

Authors:
Dale Miller;Elaine Pimentel
Affiliations:
-;-
Venue:
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
2002

Citing 13
Cited 11

The foundation of a generic theorem prover

Journal of Automated Reasoning
A framework for defining logics

Journal of the ACM (JACM)
LKQ and LKT

Proceedings of the workshop on Advances in linear logic
Proof theoretic approach to specification languages

Proof theoretic approach to specification languages
Forum: a multiple-conclusion specification logic

ALP Proceedings of the fourth international conference on Algebraic and logic programming
Cut-elimination for a logic with definitions and induction

Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Proving termination with multiset orderings

Communications of the ACM
A Non-commutative Extension of Classical Linear Logic

TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Abstract Syntax for Variable Binders: An Overview

CL '00 Proceedings of the First International Conference on Computational Logic
The pi-Calculus as a Theory in Linear Logic: Preliminary Results

ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
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
Canonical Propositional Gentzen-Type Systems

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

Towards an algorithmic construction of cut-elimination procedures†

Mathematical Structures in Computer Science
Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Focusing in Linear Meta-logic

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A triple correspondence in canonical calculi: strong cut-elimination, coherence, and non-deterministic semantics

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A Framework for Proof Systems

Journal of Automated Reasoning
Specifying Proof Systems in Linear Logic with Subexponentials

Electronic Notes in Theoretical Computer Science (ENTCS)
Modular cut-elimination: finding proofs or counterexamples

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the specification of sequent systems

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Canonical gentzen-type calculi with (n,k)-ary quantifiers

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A formal framework for specifying sequent calculus proof systems

Theoretical Computer Science
Finite-valued Semantics for Canonical Labelled Calculi

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear logic can be used as a meta-logic for the specification of some sequent calculus proof systems. We explore in this paper properties of such linear logic specifications. We show that derivability of one proof system from another has a simple decision procedure that is implemented simply via bounded logic programming search. We also provide conditions to ensure that an encoded proof system has the cut-elimination property and show that this can be decided again by simple, bounded proof search algorithms.