Abstract
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.
Similar content being viewed by others
References
R. Cignoli, F. Esteva, L. Godo and A. Torrens, 'Basic fuzzy logic is the logic of continuous t-norms and their residua', Soft Computing 4 (2000) 106-112.
R. Cignoli, D. Mundici and I. M. L. D'Ottaviano, Algebraic Foundations of Many-Valued Reasoning, Kluwer 2000.
K. DoŠen, 'Sequent systems and groupoid models I', Studia Logica XLVII (1988) 353-385.
K. DoŠen, 'Sequent systems and groupoid models II', Studia Logica XLVIII (1989) 41-65.
F. Esteva and L. Godo, 'Monoidal t-norm based logic: towards a logic for left-continuous t-norms', Fuzzy Sets and Systems 124 (2001), 271-288.
F. Esteva, L. Godo, J. Gispert and F. Montagna, 'On the standard and rational completeness of some axiomatic extensions of the monoidal t-norm logic', Studia Logica, this volume, 393-420.
P. HÁjek, Metamathematics of Fuzzy Logic, Kluwer, 1998.
P. HÁjek, 'Fuzzy logic and arithmetical hierarchy III', Studia Logica 68,1 (2001), 129-142.
S. Jenei and F. Montagna, 'A proof of standard completeness for Esteva's and Godo's logic MTL', Studia Logica 70,2 (2002), 183-192.
E. Kiriyama and H. Ono, 'The contraction rule and decision problems for logics without structural rules', Studia Logica L, 2 (1991), 299-319.
E. P. Klement, R. Mesiar and E. Pap, Triangular Norms, Kluwer Academic Publishers, Dordrecht (2000).
Y. Komori, 'Pedicate logics without the structure rules', Studia Logica 45 (1986), 393-404.
J. Lambek, 'The mathematics of sentence structure', American Mathematical Monthly 12 (1958), 166-178.
F. Montagna, 'Three complexity problems in predicate fuzzy logic', Studia Logica 68,1 (2001), 143-152.
H. Ono, 'Semantical analysis of predicate logics without the contraction rule', Studia Logica 44,2 (1985), 187-196.
H. Ono, 'Structural rules and a logical hierarchy', in: Mathematical Logic, Proceedings of the Summer School and Conference on Mathematical Logic, Heyting'88, P.P. Petkov (ed.), Plenum Press, 1990, pp. 95-104.
H. Ono, 'Semantics for substructural logics', in: Substructural Logics, eds. by K. Došen and P. Schroeder-Heister, Oxford University Press, 1993, pp. 259-291.
H. Ono, 'Logics without the contraction rule and residuated lattices I', Festschrift on the occasion of R. K. Meyer's 65th birthday (forthcoming).
H. Ono and Y. Komori, 'Logics without the contraction rule', Journal of Symbolic Logic 50 (1985), 169-201.
M. E. Ragaz, Arithmetische Klassification von Formelnmenge der unendlichwertigen Logik, ETH Zürich, (1981) Thesis.
A. S. Troelstra and D. van Dalen, Constructivism in Mathematics. An Introduction vol.II, Studies in Logic and the Foundations of Mathematics, vol. 123, North-Holland, 1988.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Montagna, F., Ono, H. Kripke Semantics, Undecidability and Standard Completeness for Esteva and Godo's Logic MTL∀. Studia Logica 71, 227–245 (2002). https://doi.org/10.1023/A:1016500922708
Issue Date:
DOI: https://doi.org/10.1023/A:1016500922708