Proving theorems of the second order Lambek calculus in polynomial time

DOI10.1007/BF01057934MaRDI QIDQ1337601zbMATH OpenOpenAlexFDO

Authors Erik Aarts

Publication date 10 November 1994

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01057934

zbMATH Keywords

algorithmdecision problem of provabilityLambek calculus of order 2normal formpolynomial timeprovability of sequentssecond-order sequents

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7204441
• scientific article; zbMATH DE number 1341472
• Lambek calculus is NP-complete
• Proof Nets for Lambek Calculus
• Lambek calculus with a unit and one division

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• The Mathematics of Sentence Structure

Cited in

(2)

• Lambek calculus is NP-complete
• scientific article; zbMATH DE number 7204441 (Why is no real title available?)

This page was built for publication: Proving theorems of the second order Lambek calculus in polynomial time

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