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: 92,440

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

On the Euler characteristic of definable groups.Mário J. Edmundo - 2011 - Mathematical Logic Quarterly 57 (1):44-46.
A remark on divisibility of definable groups.Mário J. Edmundo - 2005 - Mathematical Logic Quarterly 51 (6):639-641.
Definably connected nonconnected sets.Antongiulio Fornasiero - 2012 - Mathematical Logic Quarterly 58 (1):125-126.
Definably complete structures are not pseudo-enumerable.Antongiulio Fornasiero - 2011 - Archive for Mathematical Logic 50 (5-6):603-615.
Splitting definably compact groups in o-minimal structures.Marcello Mamino - 2011 - Journal of Symbolic Logic 76 (3):973 - 986.
Noetherian varieties in definably complete structures.Tamara Servi - 2008 - Logic and Analysis 1 (3-4):187-204.
A Note on Weakly O-Minimal Structures and Definable Completeness.Alfred Dolich - 2007 - Notre Dame Journal of Formal Logic 48 (2):281-292.
Groups of dimension two and three over o-minimal structures.A. Nesin, A. Pillay & V. Razenj - 1991 - Annals of Pure and Applied Logic 53 (3):279-296.
O-minimal analytic separation of sets in dimension 2.Andreas Fischer - 2009 - Annals of Pure and Applied Logic 157 (2-3):130-138.

Analytics

Added to PP
2018-01-11

Downloads
8 (#1,324,759)

6 months
3 (#984,658)

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