Abstract
The propositional linear logic is known to be undecidable. We prove that the full propositional linear affine logic containing all multiplicatives, additives, exponentials, and constants is decidable. The proof is based on a reduction of linear affine logic to sequents of specific normal forms, and on a generalization of M.I. Kanovich's (1992) computational interpretation of linear logic adaptive to these normal forms.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
