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

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.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
ISBN(s)
DOI 10.1002/malq.201400034
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,756
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

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

Citations of this work BETA

No citations found.

Add more citations

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 index
2018-01-11

Total views
3 ( #1,248,388 of 2,333,923 )

Recent downloads (6 months)
3 ( #256,105 of 2,333,923 )

How can I increase my downloads?

Downloads

Sorry, there are not enough data points to plot this chart.

My notes