Ordered Algebraic Structures 1989
DOI: 10.1007/978-94-009-2472-7_6
|View full text |Cite
|
Sign up to set email alerts
|

The Gate Completion G: of a Lattice-Ordered Permutation Group

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
21
0

Year Published

1997
1997
2015
2015

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(23 citation statements)
references
References 2 publications
2
21
0
Order By: Relevance
“…It follows from the definitions of h and i that lg 1 \ lg and ug 1 5ug, contrary to the fact that ug 1 must be related to ug exactly as lg 1 is related to lg. This completes the proof of (1) from (6), and so also the proof of the theorem.…”
Section: The Proof Of Theorem 31supporting
confidence: 50%
See 4 more Smart Citations
“…It follows from the definitions of h and i that lg 1 \ lg and ug 1 5ug, contrary to the fact that ug 1 must be related to ug exactly as lg 1 is related to lg. This completes the proof of (1) from (6), and so also the proof of the theorem.…”
Section: The Proof Of Theorem 31supporting
confidence: 50%
“…In this article we introduce the notion of a tying in an l-permutation group. Since we believe tyings to be natural and important, and since this article is the first of several on the subject ( [7] being a preview and [8] a sequel), we precede the formal definition with several examples. Though simple and close at hand, these examples are prototypical of the main types of l-permutation groups [10].…”
Section: Introduction and Statement Of Resultsmentioning
confidence: 99%
See 3 more Smart Citations