The following pages link to (Q4842970):
Displaying 12 items.
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- Possible worlds and resources: The semantics of \(\mathbf{BI}\) (Q1826634) (← links)
- Lambek calculus is NP-complete (Q2500488) (← links)
- The decidability of the intensional fragment of classical linear logic (Q2517231) (← links)
- Enforcing Availability in Failure-Aware Communicating Systems (Q2827467) (← links)
- Which Logic for the Radical Anti-realist? (Q2908756) (← links)
- Structural Analysis of Narratives with the Coq Proof Assistant (Q3087995) (← links)
- Disentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive Power (Q3172834) (← links)
- Stoic Sequent Logic and Proof Theory (Q5208124) (← links)
- Extended Lambek Calculi and First-Order Linear Logic (Q5414971) (← links)
- Parsing MELL proof nets (Q5940925) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
