scientific article; zbMATH DE number 786489

zbMath0823.03004MaRDI QIDQ4842970

Patrick D. Lincoln

Publication date: 31 October 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveycomplexitydecidabilityprovabilityfragments of linear logic

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (12)

Disentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive Power ⋮ Which Logic for the Radical Anti-realist? ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Extended Lambek Calculi and First-Order Linear Logic ⋮ Disjunction property and complexity of substructural logics ⋮ Parsing MELL proof nets ⋮ Lambek calculus is NP-complete ⋮ Stoic Sequent Logic and Proof Theory ⋮ The decidability of the intensional fragment of classical linear logic ⋮ Structural Analysis of Narratives with the Coq Proof Assistant ⋮ Enforcing Availability in Failure-Aware Communicating Systems ⋮ Possible worlds and resources: The semantics of \(\mathbf{BI}\)

This page was built for publication: