Semantical analysis of predicate logics without the contraction rule (Q1077403)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Semantical analysis of predicate logics without the contraction rule |
scientific article; zbMATH DE number 3957063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semantical analysis of predicate logics without the contraction rule |
scientific article; zbMATH DE number 3957063 |
Statements
Semantical analysis of predicate logics without the contraction rule (English)
0 references
1985
0 references
A semantics for some predicate logics without the contraction rule is introduced in this paper. Each structure in our semantics is a partially- ordered monoid which is also a complete meet-semilattice with a constant domain. By using the method developed by the author and \textit{Y. Komori} in J. Symb. Logic 50, 169-201 (1985; Zbl 0583.03018), the completeness theorem is proved. Then it is shown that the above semantics has a close connection with Beth semantics.
0 references
Kripke models
0 references
Beth models
0 references
semantics
0 references
partially-ordered monoid
0 references
complete meet-semilattice
0 references
completeness theorem
0 references
0.8441842794418335
0 references
0.8202918171882629
0 references
0.7868412733078003
0 references
0.7726261019706726
0 references
