Papers
Topics
Authors
Recent
Search
2000 character limit reached

O-minimalism

Published 6 Jun 2011 in math.LO | (1106.1196v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.