Switch to: References

Add citations

You must login to add citations.
  1. Definable combinatorics with dense linear orders.Himanshu Shukla, Arihant Jain & Amit Kuber - 2020 - Archive for Mathematical Logic 59 (5-6):679-701.
    We compute the model-theoretic Grothendieck ring, \\), of a dense linear order 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. This ring can be embedded in the polynomial ring over \ generated by \. As a corollary we obtain that a DLO satisfies the pigeon hole principle for definable (...)
    Download  
     
    Export citation  
     
    Bookmark