scientific article; zbMATH DE number 1303445

From MaRDI portal
Publication:4250055





The paper is a presentation of known and new results concerning formalisms that are weaker than the full associative Lambek calculus in the sense of Ono (1993). The author presents a proof calculus for tree models, relational deductive systems for language models and a relational calculus for Barwise's logic of information flow. Completeness theorems are also proved, using a Rasiowa-Sikorski-style tableaux deduction method. Some remarks about decidability of fragments of the given logics and the connection between various relational semantics complete the paper. For the entire collection see [Zbl 0910.00016].











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 Q4250055)