✦ LIBER ✦

On Orderable Fields

✍ Scribed by P. Ribenboim

Publisher: John Wiley and Sons
Year: 1969
Tongue: English
Weight: 619 KB
Volume: 40
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19690400412

No coin nor oath required. For personal study only.

✦ Synopsis

I n this paper, we introduce the concept of a formally negative set in an orderable field and we study field extensions in which certain collections of orders of the ground field may be extended to the larger field. Our methods are altogether classical and actually our definitions and results are very iimilar to those found in B O U R B ~K I

[I], exercises 8, 9, page 43. $! r e shall explain in the text how a twist in the definitions has given advantages t o our treatment.

K e conclude the paper with two applications to the theory of algebraic iinmbei-fields.

📜 SIMILAR VOLUMES

On BF-orderable graphs

✍ Kurt Mehlhorn; Bernd H. Schmidt 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 534 KB

On Borel orderable groups

✍ J.R.P. Christensen; Vladimir Kanovei; Michael Reeken 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 163 KB

We prove that any Borel Abelian ordered group B, having a countable subgroup G as the largest convex subgroup, and such that the quotient B/G is order isomorphic to R, the reals, is Borel grouporder isomorphic to the product R × G, ordered lexicographically. As a main ingredient of this proof, we sh

*-orderable semigroups

✍ Igor Klep; Primož Moravec 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 428 KB

A note on perfectly orderable graphs

✍ Chinh T. Hoàng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 535 KB

On some classes of orderable groups

✍ Longobardi, Patrizia ;Maj, Mercede 📂 Article 📅 1998 🏛 Springer-Verlag ⚖ 578 KB

Properly orderable graphs

✍ Irena Rusu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 456 KB

In a graph G = (V, E) provided with a linear order ' < ' on T/, a chordless path with vertices a, h, c, d and edges ub, bc, cd is called an obstruction if both a < b and d < c hold. Chvatal(l984) defined the class of perfectly orderable graphs (i.e., graphs possessing an acyclic orientation of the e