Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Definable combinatorics with dense linear orders

Definable combinatorics with dense linear orders We compute the model-theoretic Grothendieck ring, K0(Q)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$K_0({\mathcal {Q}})$$\end{document}, of a dense linear order (DLO) with or without end points, Q=(Q,<)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathcal {Q}}=(Q,<)$$\end{document}, as a structure of the signature {<}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\{<\}$$\end{document}, and show that it is a quotient of the polynomial ring over Z\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathbb {Z}}$$\end{document} generated by N+×(Q⊔{-∞})\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathbb {N}}_+\times (Q\sqcup \{-\infty \})$$\end{document} by an ideal that encodes multiplicative relations of pairs of generators. This ring can be embedded in the polynomial ring over Q\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathbb {Q}}$$\end{document} generated by Q⊔{-∞}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$Q\sqcup \{-\infty \}$$\end{document}. As a corollary we obtain that a DLO satisfies the pigeon hole principle for definable subsets and definable bijections between them—a property that is too strong for many structures. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Definable combinatorics with dense linear orders

Loading next page...
 
/lp/springer-journals/definable-combinatorics-with-dense-linear-orders-fItHE79CaF
Publisher
Springer Journals
Copyright
Copyright © Springer-Verlag GmbH Germany, part of Springer Nature 2020
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/s00153-020-00709-8
Publisher site
See Article on Publisher Site

Abstract

We compute the model-theoretic Grothendieck ring, K0(Q)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$K_0({\mathcal {Q}})$$\end{document}, of a dense linear order (DLO) with or without end points, Q=(Q,<)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathcal {Q}}=(Q,<)$$\end{document}, as a structure of the signature {<}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\{<\}$$\end{document}, and show that it is a quotient of the polynomial ring over Z\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathbb {Z}}$$\end{document} generated by N+×(Q⊔{-∞})\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathbb {N}}_+\times (Q\sqcup \{-\infty \})$$\end{document} by an ideal that encodes multiplicative relations of pairs of generators. This ring can be embedded in the polynomial ring over Q\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathbb {Q}}$$\end{document} generated by Q⊔{-∞}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$Q\sqcup \{-\infty \}$$\end{document}. As a corollary we obtain that a DLO satisfies the pigeon hole principle for definable subsets and definable bijections between them—a property that is too strong for many structures.

Journal

Archive for Mathematical LogicSpringer Journals

Published: Jan 22, 2020

There are no references for this article.