Abstract
The decision problem is studied for the nonmodal or multiplicative-additive fragment of first-order linear logic. This fragment is shown to be NEXPTIME-hard. The hardness proof combines Shapiro's logic programming simulation of nondeterministic Turing machines with the standard proof of the PSPACE-hardness of quantified boolean formula validity, utilizing some of the surprisingly powerful and expressive machinery of linear logic.
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.
