Copyright © 2005 Elsevier B.V. All rights reserved.
Received 21 February 2005;
revised 23 May 2005;
accepted 31 May 2005.
Available online 9 August 2005.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper, we show that the set of all pseudo-t-norms, the set of all implications, the set of all infinitely
-distributive pseudo-t-norms, and the set of all infinitely
-distributive implications on a complete Brouwerian lattice are all complete lattices and lay bare the formulas for calculating the smallest pseudo-t-norm (the smallest infinitely
-distributive pseudo-t-norm) that is stronger than a binary operation and the largest implication (the largest infinitely
-distributive implication) that is weaker than a binary operation.
Keywords: Non-classical logic; t-norm; Pseudo-t-norm; Implication






E-mail Article
Add to my Quick Links

Cited By in Scopus (4)

-distributive t-norm on 




