Semantical analysis of predicate logics without the contraction rule

DOI10.1007/BF00379766MaRDI QIDQ1077403zbMATH OpenOpenAlexFDO

Authors Hiroakira Ono

Publication date 1985

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00379766

zbMATH Keywords

Beth modelscomplete meet-semilatticecompleteness theoremKripke modelspartially-ordered monoidsemantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Review text

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.

Recommendations

• Predicate logics without the structure rules
• Logics without the contraction rule
• A contractionless semilattice semantics
• scientific article; zbMATH DE number 3970731
• Intuitionistic propositional logic without `contraction' but with `reductio'

Cites work

• Logics without the contraction rule

Cited in

(8)

• Predicate logics without the structure rules
• On the structure of varieties with equationally definable principal congruences. III
• Logics without the contraction rule
• scientific article; zbMATH DE number 3954869 (Why is no real title available?)
• scientific article; zbMATH DE number 3970731 (Why is no real title available?)
• Algebraic Kripke-style semantics for relevance logics
• Cover systems for the modalities of linear logic
• Dual tableau for monoidal triangular norm logic MTL

This page was built for publication: Semantical analysis of predicate logics without the contraction rule

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077403)