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.
Similar content being viewed by others
References
Blok, W. J., and C. J. Van Alten, ‘The finite embeddability property for residuated lattices, pocrims and BCK-algebras’, Algebra Universalis 48:253-271, 2002.
Jenei, S., and F. Montagna, ‘A proof of standard completeness for Esteva and Godo's Logic MTL’, Studia Logica 70:183-192, 2002.
Kowalski, T., and H. Ono, ‘Residuated Lattices: An algebraic glimpse at logics without contraction’, monograph, March, 2001.
Montagna, F., and H. Ono, ‘Kripke semantics, undecidability and standard completeness for Esteva and Godo's Logic MTL∀’, Studia Logica 71:227-245, 2002.
Ono, H., ‘Semantics for substructural logics’, in K. Došen and P. Schroeder-Heister, (eds.), Substructural Logics, pages 259-291. Oxford University Press, 1993.
Ono, H., and Y. Komori, ‘Logics without the contraction rule’, The Journal of Symbolic Logic 50:169-201, 1985.
Restall, G., An Introduction to Substructural Logics, Routledge, 2000.
Rosenthal, K. I., Quantales and Their Applications, Pitman Research Notes in Mathematics 234, Longman, 1990.
Troelstra, A., 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
Ono, H. Closure Operators and Complete Embeddings of Residuated Lattices. Studia Logica 74, 427–440 (2003). https://doi.org/10.1023/A:1025171301247
Issue Date:
DOI: https://doi.org/10.1023/A:1025171301247