Cell decompositions of C-minimal structures

Annals of Pure and Applied Logic 66 (2):113-162 (1994)
  Copy   BIBTEX

Abstract

C-minimality is a variant of o-minimality in which structures carry, instead of a linear ordering, a ternary relation interpretable in a natural way on set of maximal chains of a tree. This notion is discussed, a cell-decomposition theorem for C-minimal structures is proved, and a notion of dimension is introduced. It is shown that C-minimal fields are precisely valued algebraically closed fields. It is also shown that, if certain specific ‘bad’ functions are not definable, then algebraic closure has the exchange property, and for definable sets dimension coincides with the rank obtained from algebraic closure

Other Versions

No versions found

Links

PhilArchive

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
2014-01-16

Downloads
79 (#724,114)

6 months
16 (#746,739)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A version of o-minimality for the p-adics.Deirdre Haskell & Dugald Macpherson - 1997 - Journal of Symbolic Logic 62 (4):1075-1092.
On variants of o-minimality.Dugald Macpherson & Charles Steinhorn - 1996 - Annals of Pure and Applied Logic 79 (2):165-209.
Tame topology in Hensel minimal structures.Krzysztof Jan Nowak - 2025 - Annals of Pure and Applied Logic 176 (4):103540.
B-minimality.Raf Cluckers & François Loeser - 2007 - Journal of Mathematical Logic 7 (2):195-227.

View all 27 citations / Add more citations

References found in this work

On variants of o-minimality.Dugald Macpherson & Charles Steinhorn - 1996 - Annals of Pure and Applied Logic 79 (2):165-209.
More on definable sets of p-adic numbers.Philip Scowcroft - 1988 - Journal of Symbolic Logic 53 (3):912-920.

Add more references