Weakly Idempotent Lattices and Bilattices, Non-Idempotent Plonka Functions
نویسندگان
چکیده
منابع مشابه
Commutative Idempotent Residuated Lattices
We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct. A residuated lattice is an algebra A = (A,∨,∧, ·, e, /, \) such that (A,∨,∧) is a lattice, (A, ·, e) is a monoid and for every a, b, c ∈ A ab ≤ c ⇔ a ≤ c/b ⇔ b ≤ a\c. The last condition is equivalent to the fact that (A,∨,∧, ·, e) is a lattice-ordered monoid and for every a, b ∈ A there is a great...
متن کاملRepresentable Idempotent Commutative Residuated Lattices
It is proved that the variety of representable idempotent commutative residuated lattices is locally finite. The n-generated subdirectly irreducible algebras in this variety are shown to have at most 3n+1 elements each. A constructive characterization of the subdirectly irreducible algebras is provided, with some applications. The main result implies that every finitely based extension of posit...
متن کاملUnification of Idempotent Functions
For a l m o s t as l o n g as a t t e m p t s a t p r o v i n g theorems by mach ines have been made, a c r i t i c a l p r o b l e m has been w e l l known: E q u a t i o n a l a x i o m s , i f l e f t w i t h o u t p r e c a u t i o n s i n t he d a t a base o f a n a u t o m a t i c t heo rem p r o v e r (ATP) , w i l l f o r c e the ATP t o g o a s t r a y . Four approaches t o cope w i t ...
متن کاملOrness For Idempotent Aggregation Functions
Aggregation functions are mathematical operators that merge given data in order to obtain a global value that preserves the information given by the data as much as possible. In most practical applications, this value is expected to be between the infimum and the supremum of the given data, which is guaranteed only when the aggregation functions are idempotent. Ordered weighted averaging (OWA) ...
متن کاملCollapsing non-idempotent intersection types
We proved recently that the extensional collapse of the relational model of linear logic coincides with its Scott model, whose objects are preorders and morphisms are downwards closed relations. This result is obtained by the construction of a new model whose objects can be understood as preorders equipped with a realizability predicate. We present this model, which features a new duality, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Demonstratio Mathematica
سال: 2015
ISSN: 2391-4661,0420-1213
DOI: 10.1515/dema-2015-0037