Closure Operators and Complete Embeddings of Residuated Lattices

Studia Logica 74 (3):427-440 (2003)
  Copy   BIBTEX

Abstract

In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follow, including various types of completeness theorems of substructural logics.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

From semirings to residuated Kleene lattices.Peter Jipsen - 2004 - Studia Logica 76 (2):291 - 303.
2-CNFS and Logical Embeddings.Robert Cowen - 2009 - Studia Logica 93 (1):15-19.
On the representation of n4-lattices.Sergei P. Odintsov - 2004 - Studia Logica 76 (3):385 - 405.
★-autonomous Lattices.Francesco Paoli - 2005 - Studia Logica 79 (2):283-304.

Analytics

Added to PP
2016-02-18

Downloads
12 (#1,058,801)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?