A proof of standard completeness for Esteva and Godo's logic MTL

Studia Logica 70 (2):183-192 (2002)
In the present paper we show that any at most countable linearly-ordered commutative residuated lattice can be embedded into a commutative residuated lattice on the real unit interval [0, 1]. We use this result to show that Esteva and Godo''s logic MTL is complete with respect to interpretations into commutative residuated lattices on [0, 1]. This solves an open problem raised in.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.1023/A:1015122331293
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,217
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Rostislav Horĉík (2005). Standard Completeness Theorem for ΠMTL. Archive for Mathematical Logic 44 (4):413-424.

View all 16 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

21 ( #222,450 of 1,941,080 )

Recent downloads (6 months)

6 ( #149,738 of 1,941,080 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.