On the complexity of disjunction and explicit definability properties in some intermediate logics

DOI10.1007/3-540-36078-6_12MaRDI QIDQ4428299zbMATH OpenFDO

Authors Mauro Ferrari, Camillo Fiorentini, Guido Fiorino

Publication date 15 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2514/25140175.htm

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Intermediate logics (03B55) Complexity of proofs (03F20)

Recommendations

• On the complexity of the disjunction property in intuitionistic and modal logics
• The complexity of the disjunction and existential properties in intuitionistic logic
• On maximal intermediate logics with the disjunction property
• The complexity of disjunction in intuitionistic logic
• The complexity of disjunction in intuitionistic logic
• The disjunction property of intermediate propositional logics
• scientific article; zbMATH DE number 3999891
• Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property
• Disjunction property and complexity of substructural logics
• scientific article; zbMATH DE number 5896226

Cited in

(9)

• An infinite class of maximal intermediate propositional logics with the disjunction property
• The complexity of the disjunction and existential properties in intuitionistic logic
• scientific article; zbMATH DE number 3885877 (Why is no real title available?)
• scientific article; zbMATH DE number 4143949 (Why is no real title available?)
• scientific article; zbMATH DE number 4063066 (Why is no real title available?)
• The complexity of disjunction in intuitionistic logic
• On the complexity of the disjunction property in intuitionistic and modal logics
• Disjunction property and complexity of substructural logics
• Universal proof theory: feasible admissibility in intuitionistic modal logics

This page was built for publication: On the complexity of disjunction and explicit definability properties in some intermediate logics

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