Pseudo definably connected definable sets

Mathematical Logic Quarterly 62 (3):241-248 (2016)
  Copy   BIBTEX

Abstract

In o-minimal structures, every cell is definably connected and every definable set is a finite union of its definably connected components. In this note, we introduce pseudo definably connected definable sets in weakly o-minimal structures having strong cell decomposition, and prove that every strong cell in those structures is pseudo definably connected. It follows that every definable set can be written as a finite union of its pseudo definably connected components. We also show that the projections of pseudo definably connected definable sets are pseudo definably connected. Finally, we compare pseudo definable connectedness with weak definable connectedness of definable sets in weakly o-minimal structures.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2018-01-11

Downloads
8 (#517,646)

6 months
3 (#1,723,834)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Weakly o-minimal nonvaluational structures.Roman Wencel - 2008 - Annals of Pure and Applied Logic 154 (3):139-162.
Elimination of quantifiers for ordered valuation rings.M. A. Dickmann - 1987 - Journal of Symbolic Logic 52 (1):116-128.

Add more references