Disjunction property and complexity of substructural logics
DOI10.1016/J.TCS.2011.04.004zbMATH Open1231.03021OpenAlexW1983988429MaRDI QIDQ549720FDOQ549720
Kazushige Terui, Rostislav Horčík
Publication date: 18 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.004
Recommendations
- An algebraic approach to the disjunction property of substructural logics
- scientific article
- On the complexity of the disjunction property in intuitionistic and modal logics
- Propositional logics complexity and the sub-formula property
- The complexity of disjunction in intuitionistic logic
- The complexity of disjunction in intuitionistic logic
- Proof complexity of substructural logics
- The complexity of the disjunction and existential properties in intuitionistic logic
- scientific article; zbMATH DE number 6440890
- scientific article; zbMATH DE number 1980925
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- Decision problems for propositional linear logic
- Metamathematics of fuzzy logic
- Title not available (Why is that?)
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The Logic of Bunched Implications
- Linear logic
- Title not available (Why is that?)
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Residuated lattices. An algebraic glimpse at substructural logics
- Title not available (Why is that?)
- Complexity issues in Basic Logic
- Intuitionistic propositional logic is polynomial-space complete
- Handbook of philosophical logic. Vol. 6
- Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL
- Expanding the Realm of Systematic Proof Theory
- An algebraic approach to the disjunction property of substructural logics
- On the polynomial-space completeness of intuitionistic propositional logic
- Title not available (Why is that?)
- On the complexity of nonassociative Lambek calculus with unit
- Classical non-associative Lambek calculus
Cited In (20)
- Title not available (Why is that?)
- Integrally closed residuated lattices
- Multi-Sorted Residuation
- The complexity of disjunction in intuitionistic logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extensions of Lambek Calculi
- From cut-free calculi to automated deduction: the case of bounded contraction
- Conuclear images of substructural logics
- BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
- Varieties generated by standard BL-algebras
- Title not available (Why is that?)
- Some Syntactic Interpretations in Different Systems of Full Lambek Calculus
- Proof complexity of substructural logics
- Title not available (Why is that?)
- An algebraic approach to the disjunction property of substructural logics
- Algebraic proof theory for LE-logics
- Proof search and co-NP completeness for many-valued logics
- Complexity of some language fragments of fuzzy logics
- A Generalization of Maksimova’s Criterion for the Disjunction Property
This page was built for publication: Disjunction property and complexity of substructural logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549720)
