Definable combinatorics with dense linear orders (Q781513)

To any first-order structure, one can associate the corresponding Grothendieck ring of definable sets. (It is generated by the definable sets up to definable bijection; disjoint unions correspond to addition and Cartesian products to multiplication.) The authors give a precise description of this Grothendieck ring for dense linear orders without endpoints (and then also deduce similar results for dense linear orders with endpoint(s)). As a corollary, they deduce the pigeon hole principle (there is no definable bijection between a definable set and a proper subset).