✦ LIBER ✦

On Banaschewski functions in lattices

✍ Scribed by Mikko Saarimäki; Pekka Sorjonen

Publisher: Springer
Year: 1991
Tongue: English
Weight: 647 KB
Volume: 28
Category: Article
ISSN: 0002-5240
DOI: 10.1007/bf01190414

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coordinatization of lattices by regular

Coordinatization of lattices by regular rings without unit and Banaschewski functions

✍ Friedrich Wehrung 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 295 KB

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 (

Boolean functions on distributive lattic

Boolean functions on distributive lattices

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

On Rank Functions of Lattices

✍ Marcel Wild 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 311 KB

Supermodular Functions on Finite Lattice

Supermodular Functions on Finite Lattices

✍ S. David Promislow; Virginia R. Young 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 395 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