✦ LIBER ✦

On Rank Functions of Lattices

✍ Scribed by Marcel Wild

Publisher: Springer Netherlands
Year: 2005
Tongue: English
Weight: 311 KB
Volume: 22
Category: Article
ISSN: 0167-8094
DOI: 10.1007/s11083-005-9025-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Belief functions on lattices

✍ Michel Grabisch 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

We extend the notion of belief function to the case where the underlying structure is no more the Boolean lattice of subsets of some universal set, but any lattice, which we will endow with a minimal set of properties according to our needs. We show that all classical constructions and definitions (

Rank functions on rings

✍ P.M Cohn 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 807 KB

The complexity of functions on lattices

✍ J.W. Sander; R. Tijdeman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Let f : Z → {0; 1} be a given function. In 1938, Morse and Hedlund observed that if the number of distinct vectors (f(x + 1); : : : ; f(x + n)), x ∈ Z, called complexity, is at most n for some positive integer n, then f is periodic with period at most n. This result is best possible. Functions with

Homomorphisms on Lattices of Continuous

Homomorphisms on Lattices of Continuous Functions

✍ Félix Cabello Sánchez 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 314 KB

Boolean functions on distributive lattic

Boolean functions on distributive lattices

✍ G. Grätzer 📂 Article 📅 1964 🏛 Akadmiai Kiad 🌐 English ⚖ 325 KB

On Banaschewski functions in lattices

✍ Mikko Saarimäki; Pekka Sorjonen 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 647 KB