Switch to: References

Citations of:

Semantical analysis of predicate logics without the contraction rule

Hiroakira Ono

Studia Logica 44 (2):187 - 196 (1985)

Add citations

You must login to add citations.

Algebraic Kripke-Style Semantics for Relevance Logics.Eunsuk Yang - 2014 - Journal of Philosophical Logic 43 (4):803-826.details This paper deals with one kind of Kripke-style semantics, which we shall call algebraic Kripke-style semantics, for relevance logics. We first recall the logic R of relevant implication and some closely related systems, their corresponding algebraic structures, and algebraic completeness results. We provide simpler algebraic completeness proofs. We then introduce various types of algebraic Kripke-style semantics for these systems and connect them with algebraic semantics. Download Export citation Bookmark 2 citations
On the role of implication in formal logic.Jonathan Seldin - 2000 - Journal of Symbolic Logic 65 (3):1076-1114.details Evidence is given that implication (and its special case, negation) carry the logical strength of a system of formal logic. This is done by proving normalization and cut elimination for a system based on combinatory logic or λ-calculus with logical constants for and, or, all, and exists, but with none for either implication or negation. The proof is strictly finitary, showing that this system is very weak. The results can be extended to a "classical" version of the system. They can (...) Download Export citation Bookmark
Kripke semantics, undecidability and standard completeness for Esteva and Godo's logic MTL∀.Franco Montagna & Hiroakira Ono - 2002 - Studia Logica 71 (2):227-245.details The present paper deals with the predicate version MTL of the logic MTL by Esteva and Godo. We introduce a Kripke semantics for it, along the lines of Ono''s Kripke semantics for the predicate version of FLew (cf. [O85]), and we prove a completeness theorem. Then we prove that every predicate logic between MTL and classical predicate logic is undecidable. Finally, we prove that MTL is complete with respect to the standard semantics, i.e., with respect to Kripke frames on the (...) Download Export citation Bookmark 12 citations
Predicate logics without the structure rules.Yuichi Komori - 1986 - Studia Logica 45 (4):393 - 404.details In our previous paper [5], we have studied Kripke-type semantics for propositional logics without the contraction rule. In this paper, we will extend our argument to predicate logics without the structure rules. Similarly to the propositional case, we can not carry out Henkin's construction in the predicate case. Besides, there exists a difficulty that the rules of inference () and () are not always valid in our semantics. So, we have to introduce a notion of normal models. Download Export citation Bookmark 13 citations

1