Proving theorems of the second order Lambek calculus in polynomial time

DOI10.1007/BF01057934zbMath0807.03018OpenAlexW2008711558MaRDI QIDQ1337601

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

algorithmnormal formpolynomial timedecision problem of provabilityLambek calculus of order 2provability of sequentssecond-order sequents

Mathematics Subject Classification ID

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

Related Items (2)

Lambek calculus is NP-complete ⋮ Unnamed Item

Cites Work

• The Mathematics of Sentence Structure
• Unnamed Item

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