✦ LIBER ✦

Uniform Structures on the Lattices of Open Sets

✍ Scribed by Ellen E. Reed; W. J. Thron

Publisher: John Wiley and Sons
Year: 1968
Tongue: English
Weight: 940 KB
Volume: 36
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19680360502

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the uniformity of the closed-set latt

On the uniformity of the closed-set lattice of a tree

✍ K.M. Koh; K.S. Poh 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Denote by e\*(L) and ~,(L) respectively the upper length and lower length of a finite lattice L. The lattice L is said to be uniform if for each integer k with e,(L) < k < ¢\*(L) there exists in L a maximal chain of length k. It is shown that the closed-set lattice of a finite graph G is uniform if

On open-set lattices and some of their a

On open-set lattices and some of their applications in semantics

✍ Mouw-Ching Tjiok 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views

In this article, we present the theory of Kripke semantics, along with the mathematical framework and applications of Kripke semantics. We take the Kripke-Sato approach to define the knowledge operator in relation to Hintikka's possible worlds model, which is an application of the semantics of intui

The Structure of the Lattice of Recursiv

The Structure of the Lattice of Recursive Sets

✍ Bernhard G. Goetze 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB 👁 1 views

Transitivity on sets of independent poin

Transitivity on sets of independent points in geometric lattices

✍ Anne Delandtsheer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 177 KB

On the optimal structure of recovering s

On the optimal structure of recovering set pairs in lattices: the sandglass conjecture

✍ Rudolf Ahlswede; Gábor Simonyi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 312 KB

We present a conjecture concerning the optimal structure of a subset pair satisfying two dual requirements in a lattice that can be derived as the product of k finite length chains. The conjecture is proved for k = 2.

Density of the Commensurability Groups o

Density of the Commensurability Groups of Uniform Tree Lattices

✍ Y.S. Liu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Let \(X\) be a universal cover of a finite connected graph, and \(\Gamma\) a group acting discretely and cocompactly on \(X\), i.e., a uniform lattice on \(X\). We announce a proof of the conjecture of H. Bass and R. Kulkarni (J. Amer. Math. Soc. No. 4 (1990), 843-902) that the commensurability grou