Pages that link to "Item:Q1192352"

The following pages link to Decision problems for propositional linear logic (Q1192352):

Displaying 38 items.

• IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE (Q3188334) (← links)
• (Q3220555) (← links)
• The finite model property for knotted extensions of propositional linear logic (Q3370755) (← links)
• Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials (Q3532470) (← links)
• On Model Checking Boolean BI (Q3644756) (← links)
• Towards a theory of resource: an approach based on soft exponentials (Q3647264) (← links)
• (Q3815280) (← links)
• Decision procedures for BDI logics (Q4209288) (← links)
• Saturated formulas in full linear logic (Q4221298) (← links)
• An analysis of (linear) exponentials based on extended sequents (Q4221772) (← links)
• (Q4228441) (← links)
• The finite model property for various fragments of linear logic (Q4382470) (← links)
• RASP and ASP as a fragment of linear logic (Q4583307) (← links)
• Non-normal modalities in variants of linear logic (Q4586144) (← links)
• Expressing additives using multiplicatives and subexponentials (Q4637626) (← links)
• A concurrent constraint programming interpretation of access permissions (Q4644356) (← links)
• The undecidability of second order linear logic without exponentials (Q4894725) (← links)
• System NEL is Undecidable (Q4924537) (← links)
• The complexity of decision procedures in relevance logic II (Q4948542) (← links)
• (Q5015208) (← links)
• (Q5018490) (← links)
• State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems (Q5049036) (← links)
• A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4 (Q5089022) (← links)
• (Q5090950) (← links)
• (Q5094132) (← links)
• MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE (Q5100054) (← links)
• (Q5144357) (← links)
• Subexponentials in non-commutative linear logic (Q5236554) (← links)
• Two decision problems in Contact Logics (Q5241914) (← links)
• On Lambek’s Restriction in the Presence of Exponential Modalities (Q5283424) (← links)
• Linear Logic Proof Games and Optimization (Q5689264) (← links)
• The undecidability theorem for the Horn-like fragment of linear logic (Revisited) (Q5741577) (← links)
• Theoretical Computer Science (Q5897348) (← links)
• The ideal view on Rackoff's coverability technique (Q5925512) (← links)
• Towards logical operations research -- propositional case (Q5957908) (← links)
• Encoding Hamiltonian circuits into multiplicative linear logic (Q5958784) (← links)
• Relational Models for the Lambek Calculus with Intersection and Constants (Q6178715) (← links)
• Algorithmic complexity for theories of commutative Kleene algebras (Q6492397) (← links)