scientific article; zbMATH DE number 2044514

MaRDI QIDQ4448378zbMATH OpenFDO

Authors N. Olivetti, Camilla Schwind

Publication date 18 February 2004

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other nonclassical logic (03B60) Cut-elimination and normal-form theorems (03F05)

Recommendations

• The computational complexity of propositional cirquent calculus
• scientific article; zbMATH DE number 1390276
• On the complexity of propositional calculus formulae
• scientific article; zbMATH DE number 5263419
• The complexity of theorem proving in circumscription and minimal entailment
• Bounded combinatory logic and lower complexity
• Reasoning under minimal upper bounds in propositional logic
• On the complexity of resource-bounded logics
• On the complexity of resource-bounded logics
• On the proof complexity of logics of bounded branching

Cited in

(2)

• Cut elimination for shallow modal logics
• New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial

This page was built for publication:

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