๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The orthocompletion of a lattice-ordered group

โœ Scribed by Roger D Bleier


Publisher
Elsevier Science
Year
1976
Weight
449 KB
Volume
79
Category
Article
ISSN
1385-7258

No coin nor oath required. For personal study only.

โœฆ Synopsis


A new construction

for the orthocompletion of an l-group is given and discussed. Its relation to the Z-group of almost-kite continuous real-valued functions on a Stone space is clarified.


๐Ÿ“œ SIMILAR VOLUMES


Valuations of Lattice-Ordered Groups
โœ Paul F. Conrad; Michael R. Darnel; David G. Nelson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 379 KB

In this paper, we introduce the concept of a valuation mapping of an l-group G onto a distributive lattice and use such valuations to investigate the structure of G. Then we examine the maximal immediate extensions of G with respect to these ลฝ valuations. For the natural valuation, these are the arc

Classes of Ultrasimplicial Lattice-Order
โœ Daniele Mundici ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 71 KB

A lattice-ordered abelian group is called ultrasimplicial iff every finite set of positive elements belongs to the monoid generated by some finite set of positive Z-independent elements. This property originates from Elliott's classification of AF C U -algebras. Using fans and their desingularizatio

Examples of lattice-ordered rings
โœ Stuart A Steinberg ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 590 KB
On lattice property of group induced con
โœ Marek Niezgoda ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

The problem of existence and uniqueness of greatest lower bound (glb) and least upper bound (lub) of a set in group induced cone (GIC) ordering is discussed. Explicit formula for the glb is given. The results are applied to obtain the best possible upper bound in GIC ordering for values of linear an

The lattice theory of r-ordered partitio
โœ Michel Serfati ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 934 KB

This paper deals with ordered patitions of a set (indexed by some integer r) considered as 'natural' extensions of subsets, mainly from the lattice theory viewpoint (secondary, ring theory aspects). The present theory is in fact a (complete) set-theoretical realization of general Post algebras. This

The lattice of antichain cutsets of a pa
โœ Gerhard Behrendt ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 125 KB

## Behrendt, G., The lattice of antichain cutsets of a partially ordered set, Discrete Mathematics 89 (1991) 201-202. Every finite lattice is isomorphic to the lattice of antichain cutsets of a finite partially ordered set whose chains have at most three elements. A subset A of a partially order