Definable combinatorics with dense linear orders
Abstract
We compute the model-theoretic Grothendieck ring, K0(Q), of a dense linear order (DLO) with or without end points, Q=(Q,<), as a structure of the signature \<\, and show that it is a quotient of the polynomial ring over Z generated by N+×(Q\-∞\) by an ideal that encodes multiplicative relations of pairs of generators. As a corollary we obtain that a DLO satisfies the pigeon hole principle (PHP) for definable subsets and definable bijections between them--a property that is too strong for many structures.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.