Abstract

In this work we consider the additive and multiplicative linear logic (AMLL) with an automated deduction point of view. Considering this recent logical framework and its possible extensions or applications to logic programming, programming with proofs or parallelism and concurrency, we propose a new algorithm that constructs a proof for a given sequent in AMLL and its termination, correctness and completeness proofs. It can be viewed as a direct (or constructive) proof of the decidability of AMLL and as a first step to consider linear logic as a basis for an extended programming logic. The restriction (and adaptation) of this result to multiplicative linear logic (MLL) gives an adequate algorithm for automatic proof net construction.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.