Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-29T08:18:52.112Z Has data issue: false hasContentIssue false

On orthomodular posets

Published online by Cambridge University Press:  09 April 2009

P. D. Finch
Affiliation:
Mathematics DepartmentMonash University, Clayton, Victoria
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let S be a poset with a greatest element 1. We denote order in S by ‘≦’ and, whenever they exist in S, l.u.b and g.l.b by ‘∨’ and ‘∧’ respectively. An orthocomplementation of S is a bijection w: SS such that x exists for each x in S and (i) xωω = x, (ii) xy implies and (iii) xxω = 1. If a poset S admits an orthocomplementation ω we call the pair (S, ω) an orthoposet.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1970

References

[1]Birkhoff, G., Lattice theory (American Math. Soc. Colloqu. Publ., 3rd ed. 1967).Google Scholar
[2]Mackey, G., Mathematical foundations of quantum mechanics (Benjamin Inc., 1963).Google Scholar
[3]Maclaren, M. Donald, ‘Atomic orthocomplemented lattices’, Pacific J. Math. 14 (1964), 597612CrossRefGoogle Scholar