pith. sign in

arxiv: 1106.1196 · v1 · pith:TW3I2K63new · submitted 2011-06-06 · 🧮 math.LO

O-minimalism

classification 🧮 math.LO
keywords o-minimalisticstructurecompletenessdecompositioninvariantstructurestametheory
0
0 comments X
read the original abstract

An ordered structure is called o-minimalistic if it has all the first-order features of an o-minimal structure. We propose a theory, DCTC (Definable Completeness/Type Completeness), that describes many properties of o-minimalistic structures (dimension theory, monotonicity, Hardy structures, quasi-cell decomposition). Failure of cell decomposition leads to the related notion of a tame structure, and we give a criterium for an o-minimalistic structure to be tame. To any o-minimalistic structure, we can associate its Grothendieck ring, which in the non-o-minimal case is a non-trivial invariant. To study this invariant, we identify a third o-minimalistic property, the Discrete Pigeonhole Principle, which in turn allows us to define discretely valued Euler characteristics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.