Studia Logica 71 (2):227-245 (2002)

Hiroakira Ono
Japan Advanced Institute of Science and Technology
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 real interval [0,1], or equivalently, with respect to MTL-algebras whose lattice reduct is [0,1] with the usual order.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1016500922708
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,379
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Mathematical Fuzzy Logics.Siegfried Gottwald - 2008 - Bulletin of Symbolic Logic 14 (2):210-239.
Algebraic Kripke-Style Semantics for Relevance Logics.Eunsuk Yang - 2014 - Journal of Philosophical Logic 43 (4):803-826.

View all 7 citations / Add more citations

Similar books and articles


Added to PP index

Total views
66 ( #175,452 of 2,519,663 )

Recent downloads (6 months)
1 ( #406,756 of 2,519,663 )

How can I increase my downloads?


My notes