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

On Finitely Generated Orthomodular Lattices

โœ Scribed by Ladislav Beran


Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
475 KB
Volume
88
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On Codimension Growth of Finitely Genera
โœ A. Giambruno; M. Zaicev ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 245 KB

Let A be a PI-algebra over a field F. We study the asymptotic behavior of the sequence of codimensions c n (A) of A. We show that if A is finitely generated over F then Inv(A)=lim n ร„ n c n (A) always exists and is an integer. We also obtain the following characterization of simple algebras: A is fi

On finite elements in vector lattices an
โœ Z. L. Chen; M. R. Weber ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 124 KB

## Abstract In Archimedean vector lattices we show that each element of the band generated by a finite element is also finite. In vector lattices with the (PPP) and in Banach lattices we obtain some characterizations of finite elements by using the generalized order units for principal bands. In th

Casimir Effect on a Finite Lattice
โœ A. Actor; I. Bender; J. Reingruber ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 673 KB
On the Geometricity of Lattices Generate
โœ Yuanji Huo; Zhe-Xian Wan ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

Let n q be the n-dimensional vector space over the finite field q and let G n be one of the classical groups of degree n over q . Let be any orbit of subspaces under G n . Denote by the set of subspaces which are intersections of subspaces in and assume the intersection of the empty set of subspaces

Cauchy's Integral Theorem on a Finitely
โœ Paul S. Pedersen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 317 KB

Let R[:]=R[: 1 , : 2 , ..., : n ] (where : 1 =1) be a real, unitary, finitely generated, commutative, and associative algebra. We consider functions We impose a total order on an algorithmically defined basis B for R[:]. The resulting algebra and ordered basis will be written as (R[:], <). We then