Definable Sets in Ordered Structures. II
Open Access
- 1 June 1986
- journal article
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 295 (2), 593-605
- https://doi.org/10.2307/2000053
Abstract
It is proved that any 0-minimal structure (in which the underlying order is dense) is strongly 0-minimal (namely, every elementarily equivalent to is 0-minimal). It is simultaneously proved that if is 0-minimal, then every definable set of -tuples of has finitely many "definably connected components."Keywords
This publication has 6 references indexed in Scilit:
- A Decision Method for Elementary Algebra and GeometryPublished by Springer Nature ,1998
- Definable Sets in Ordered Structures. ITransactions of the American Mathematical Society, 1986
- Remarks on Tarski's problem concerning (R, +, *, exp)Published by Elsevier ,1984
- Definable sets in ordered structuresBulletin of the American Mathematical Society, 1984
- Partially Ordered Rings and Semi-Algebraic GeometryPublished by Cambridge University Press (CUP) ,1979
- Elementary Structure of Real Algebraic VarietiesAnnals of Mathematics, 1957