A recipe for the complexity analysis of non-classical logics

MaRDI QIDQ2782480zbMATH OpenFDO

Authors Luca Viganò, David Basin

Publication date 14 July 2002

zbMATH Keywords

cut-free sequent systemsdecision problemdecision proceduremodal logicnatural deductionpropositional nonclassical logicsrelevance logicspace complexity

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Other nonclassical logic (03B60) Cut-elimination and normal-form theorems (03F05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Proof complexity of non-classical logics
• Proof Complexity of Non-classical Logics
• Complexity Results for Nonmonotonic Logics
• scientific article; zbMATH DE number 6131588
• A survey of complexity results for non-monotonic logics
• Logics for complexity classes
• scientific article; zbMATH DE number 4027425
• Proof analysis in non-classical logics
• scientific article; zbMATH DE number 4008383
• scientific article; zbMATH DE number 517061

Cited in

(1)

• scientific article; zbMATH DE number 1749009 (Why is no real title available?)

This page was built for publication: A recipe for the complexity analysis of non-classical logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2782480)