No label defined (Q4250055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1303445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1303445 |
Statements
23 November 1999
0 references
tableaux
0 references
Lambek calculus
0 references
relational semantics
0 references
proof calculus
0 references
tree models
0 references
relational deductive systems
0 references
language models
0 references
relational calculus
0 references
logic of information flow
0 references
0.7843433022499084
0 references
0.781464695930481
0 references
0.7762154340744019
0 references
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].
0 references