March 2003 Definable sets in Boolean ordered o-minimal structures. II
Roman Wencel
J. Symbolic Logic 68(1): 35-51 (March 2003). DOI: 10.2178/jsl/1045861505

Abstract

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.

Citation

Download Citation

Roman Wencel. "Definable sets in Boolean ordered o-minimal structures. II." J. Symbolic Logic 68 (1) 35 - 51, March 2003. https://doi.org/10.2178/jsl/1045861505

Information

Published: March 2003
First available in Project Euclid: 21 February 2003

zbMATH: 1043.03033
MathSciNet: MR1959311
Digital Object Identifier: 10.2178/jsl/1045861505

Rights: Copyright © 2003 Association for Symbolic Logic

JOURNAL ARTICLE
17 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.68 • No. 1 • March 2003
Back to Top