From Linear Proofs to Direct Logic with Exponentials

@inproceedings{Sandner1997FromLP,
  title={From Linear Proofs to Direct Logic with Exponentials},
  author={Enno Sandner},
  booktitle={KI},
  year={1997}
}
  • E. Sandner
  • Published in KI 9 September 1997
  • Mathematics, Philosophy, Computer Science
Following the idea of Linear Proofs presented in [4] we introduce the Direct Logic [14] with exponentials (DLE). The logic combines Direct Logic with the exponentials of Linear Logic. For a well-chosen subclass of formulas of this logic we provide a matrix-characterization which can be used as a foundation for proof-search methods based on the connection calculus. 

References

SHOWING 1-10 OF 26 REFERENCES
Connection-Based Proof Construction in Linear Logic
TLDR
A matrix characterization of logical validity in the multiplicative fragment of linear logic is presented and a matrix-based proof search procedure and a procedure which translates the machine-found proofs back into the usual sequent calculus for linear logic are developed.
Decidability of Linear AÆne Logic
Propositional linear logic is known to be undecidable. In the current paper we prove that full propositional linear aÆne logic containing all the multiplicatives, additives, exponentials, and
On Proof Normalization in Linear Logic
Constructive Logics. Part II: Linear Logic and Proof Nets
TLDR
An exposition of material dealing with constructive logics, typed -calculi, and linear logic, and proof nets and a direct proof of the correctness of the Danos-Regnier criterion for proof nets.
Linear logic
TLDR
This column presents an intuitive overview of linear logic, some recent theoretical results, and summarizes several applications oflinear logic to computer science.
Proof Search in the Intuitionistic Sequent Calculus
TLDR
This work defines a notion of Herbrand functions for the full intuitionistic predicate calculus, based on the view that the proof-theoretic role of herbrand functions is to ensure the eigenvariable conditions on a sequent proof.
Herbrand Methods in Sequent Calculi: Unification in LL
We propose a reformulation of quantiiers rules in sequent calculi which allows to replace blind existential instantiation with uniication, thereby reducing non-determinism and complexity in
Plan Generation by Linear Proofs: On Semantics
TLDR
This paper presents three ways towards the semantics for a logical calculus, which integrates changes in the form of transition rules into a classical logic framework, and proposes how to extend the semantics of first-order logic for the expression of planning problems.
...
...