Semantical analysis of predicate logics without the contraction rule (Q1077403): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00379766 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011534128 / rank | |||
Normal rank | |||
Latest revision as of 11:35, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semantical analysis of predicate logics without the contraction rule |
scientific article |
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
