It is known that the spaces of orders on orderable computable ΓΏelds can represent all 0 1 classes up to Turing degree. We show that the spaces of orders on orderable computable abelian and nilpotent groups cannot represent 0 1 classes in even a weak manner. Next, we consider presentations of ordered
β¦ LIBER β¦
Constructive Matrix and Orderable Groups
β Scribed by V. A. Roman'kov; N. G. Khisamiev
- Book ID
- 111570505
- Publisher
- Springer US
- Year
- 2004
- Tongue
- English
- Weight
- 150 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0002-5232
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Ξ 10 classes and orderable groups
β
Reed Solomon
π
Article
π
2002
π
Elsevier Science
π
English
β 183 KB
Ξ-Completely orderable and relatively co
β
A. I. Kokorin
π
Article
π
1967
π
SP MAIK Nauka/Interperiodica
π
English
β 277 KB
Constructible Matrix Groups
β
V. A. Roman'kov; N. G. Khisamiev
π
Article
π
2004
π
Springer US
π
English
β 153 KB
Constructing Permutation Representations
β
GENE COOPERMAN; LARRY FINKELSTEIN; MICHAEL TSELMAN; BRYANT YORK
π
Article
π
1997
π
Elsevier Science
π
English
β 465 KB
New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutat
Construction of ordered groups with appl
β
V. V. Bludov; V. F. Kleimenov
π
Article
π
1982
π
SP MAIK Nauka/Interperiodica
π
English
β 593 KB
Constructive completions of ordered sets
β
Erik Palmgren
π
Article
π
2005
π
Elsevier Science
π
English
β 236 KB