Definable sets in Boolean ordered o-minimal structures. II
Wencel, Roman
J. Symbolic Logic, Tome 68 (2003) no. 1, p. 35-51 / Harvested from Project Euclid
Let $(M,\leq,...)$ denote a Boolean ordered o-minimal structure. We prove that a Boolean subalgebra of $M$ determined by an algebraically closed subset contains no dense atoms. We show that Boolean algebras with finitely many atoms do not admit proper expansions with o-minimal theory. The proof involves decomposition of any definable set into finitely many pairwise disjoint cells, i.e., definable sets of an especially simple nature. This leads to the conclusion that Boolean ordered structures with o-minimal theories are essentially bidefinable with Boolean algebras with finitely many atoms, expanded by naming constants. We also discuss the problem of existence of proper o-minimal expansions of Boolean algebras.
Publié le : 2003-03-14
Classification: 
@article{1045861505,
     author = {Wencel, Roman},
     title = {Definable sets in Boolean ordered o-minimal structures. II},
     journal = {J. Symbolic Logic},
     volume = {68},
     number = {1},
     year = {2003},
     pages = { 35-51},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1045861505}
}
Wencel, Roman. Definable sets in Boolean ordered o-minimal structures. II. J. Symbolic Logic, Tome 68 (2003) no. 1, pp.  35-51. http://gdmltest.u-ga.fr/item/1045861505/