Definable combinatorics with dense linear orders
Logic
2018-07-18 v1
Abstract
We compute the model-theoretic Grothendieck ring, , of a dense linear order (DLO) with or without end points, , as a structure of the signature , and show that it is a quotient of the polynomial ring over generated by 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.
Cite
@article{arxiv.1807.06097,
title = {Definable combinatorics with dense linear orders},
author = {Himanshu Shukla and Arihant Jain and Amit Kuber},
journal= {arXiv preprint arXiv:1807.06097},
year = {2018}
}
Comments
20 pages