Definable Sets in Boolean-Ordered O-Minimal Structures. I

Newelski, Ludomir; Wencel, Roman

J. Symbolic Logic, Tome 66 (2001) no. 1, p. 1821-1836 / Harvested from Project Euclid

Résumé

We prove weak elimination of imaginary elements for Boolean orderings with finitely many atoms. As a consequence we obtain equivalence of the two notions of o-minimality for Boolean ordered structures, introduced by C. Toffalori. We investigate atoms in Boolean algebras induced by algebraically closed subsets of Boolean ordered structures. We prove uniqueness of prime models in strongly o-minimal theories of Boolean ordered structures.

Publié le : 2001-12-14
Classification:

@article{1183746628,
     author = {Newelski, Ludomir and Wencel, Roman},
     title = {Definable Sets in Boolean-Ordered O-Minimal Structures. I},
     journal = {J. Symbolic Logic},
     volume = {66},
     number = {1},
     year = {2001},
     pages = { 1821-1836},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746628}
}

Newelski, Ludomir; Wencel, Roman. Definable Sets in Boolean-Ordered O-Minimal Structures. I. J. Symbolic Logic, Tome 66 (2001) no. 1, pp.  1821-1836. http://gdmltest.u-ga.fr/item/1183746628/