Results 121 to 130 of about 199 (160)

Compatible Operations on Residuated Lattices

Studia Logica, 2011
The authors adopt a definition for residuated lattices in which the lattice reduct is not necessarily bounded, commutativity is not assumed either, and both the left and right residua are present. An operation \(f\) on a set \(L\) endowed with an algebraic structure is said to be compatible iff every congruence of the algebra \(L\) is also a congruence
José L. Castiglioni, Hernán Javier San Martín   +1 more
openaire   +2 more sources

Monadic Bounded Residuated Lattices

Order, 2011
Algebraic counterparts of the existential and universal quantifiers have been frequently studied for certain nonclassical logics. Monadic Boolean algebras, monadic MV-algebras, monadic Heyting algebras and monadic R\(\ell\)-monoids have been defined and studied.
Jirí Rachunek, Dana Salounová
openaire   +1 more source

Roughness in Residuated Lattices

2012
Commutative bounded integral residuated lattices (= residuated lattices) form a large class of algebras containing among others several classes of algebras of fuzzy logics which are related to reasoning under uncertainty. The paper investigates approximation spaces in residuated lattices based on their filters.
Jirí Rachunek, Dana Salounová
openaire   +1 more source

Prime Filters on Residuated Lattices

2012 IEEE 42nd International Symposium on Multiple-Valued Logic, 2012
In this short paper we give an affirmative answer to the problem left open in \cite{IEEE how to: GDCK}, that is, for any residuated lattice $L$, if prime filters and prime filters of the second kind coincide, then $L$ must be an MTL-algebra.
Michiro Kondo, Esko Turunen
openaire   +1 more source

THE STRUCTURE OF COMMUTATIVE RESIDUATED LATTICES

International Journal of Algebra and Computation, 2002
A commutative residuated lattice, is an ordered algebraic structure [Formula: see text], where (L, ·, e) is a commutative monoid, (L, ∧, ∨) is a lattice, and the operation → satisfies the equivalences [Formula: see text] for a, b, c ∊ L. The class of all commutative residuated lattices, denoted by [Formula: see text], is a finitely based variety of ...
James B. Hart, Lori Rafter, Constantine Tsinakis   +2 more
openaire   +2 more sources

Nodal filters in Residuated Lattices

Journal of Intelligent & Fuzzy Systems, 2016
In this paper, we introduce the notion of a nodal filter in residuated lattices. We give several characterizations of these filters and also some relationships between these filters and other types of filters are obtained, as well. Finally, we prove that the class of all nodal filters of a residuated lattice forms a Heyting algebra.
openaire   +2 more sources

The stable topology for residuated lattices

Soft Computing, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Catalin Busneag, Dana Piciu
openaire   +1 more source

Recursive Residuals on a Rectangular Lattice

Biometrical Journal, 1984
AbstractA set of independentN(O, ρ2) recursive residuals is obtained for a model proposed by GLEESON and McGILCHRIST (1980) to describe spatial dependence among observations on a rectangular lattice. These residuals can be used to test model adequacy in a similar fashion to Box‐Jenkins techniques for time series models.
Gleeson, A. C., McGilchrist, C. A.
openaire   +1 more source

On filter theory of residuated lattices

Information Sciences, 2010
The authors study filters, Boolean filters (implicative filters), G-filters (positive implicative filters), MV-filters (fantastic filters) and also the corresponding fuzzy filters, fuzzy Boolean filters (fuzzy implicative filters), fuzzy G-filters (fuzzy positive implicative filters), fuzzy MV-filters (fuzzy fantastic filters) of a residuated lattice ...
Yiquan Zhu, Yang Xu 0001
openaire   +2 more sources

On Gelfand residuated lattices

Soft Computing, 2022
Saeed Rasouli, Amin Dehghani
openaire   +1 more source