You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Definable Sets in Ordered Structures. II
Julia F. Knight, Anand Pillay and Charles Steinhorn
Transactions of the American Mathematical Society
Vol. 295, No. 2 (Jun., 1986), pp. 593-605
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2000053
Page Count: 13
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
It is proved that any 0-minimal structure M (in which the underlying order is dense) is strongly 0-minimal (namely, every N elementarily equivalent to M is 0-minimal). It is simultaneously proved that if M is 0-minimal, then every definable set of n-tuples of M has finitely many "definably connected components."
Transactions of the American Mathematical Society © 1986 American Mathematical Society