Abstract
We say that a countable linear ordering \(\mathcal L\) is countably complementable if there exists a linear ordering \(\overline{\mathcal L}\), possibly uncountable, such that for any countable linear ordering \(\mathcal B\),\(\mathcal L\) does not embed into \(\mathcal B\) if and only if \(\mathcal B\) embeds into \(\overline{\mathcal L}\). We characterize the linear orderings which are countably complementable. We also show that this property is equivalent to the countable version of the finitely faithful extension property introduced by Hagendorf. Using similar methods and introducing the notion of weakly countably complementable linear orderings, we answer a question posed by Rosenstein and prove the countable case of a conjecture of Hagendorf, namely, that every countable linear ordering satisfies the countable version of the totally faithful extension property.
Similar content being viewed by others
References
Bonnet, R., Pouzet, M.: Linear extensions of ordered sets. In: Ordered Sets (Banff, Alta., 1981). NATO Adv. Study Inst. Ser. C: Math. Phys. Sci., vol. 83, pp. 125–170. Reidel, Dordrecht (1982)
Clote, P.: The metamathematics of Fraïssé’s order type conjecture. In: Recursion Theory Week (Oberwolfach, 1989). Lecture Notes in Mathematics, vol. 1432, pp. 41–56. Springer, Berlin Heidelberg New York (1990)
Downey, R.G., Hirschfeldt, D.R., Lempp, S., Solomon, R.: Computability-theoretic and proof-theoretic aspects of partial and linear orderings. Isr. J. Math. 138, 271–352 (2003)
Fraïssé, R.: Sur la comparaison des types d’ordres. C. R. Acad. Sci. Paris 226, 1330–1331 (1948)
Fraïssé, R.: Theory of Relations. North Holland, Amsterdam, The Netherlands (revisted edition) (2000)
Hagendorf, J.G.: Extensions de Chaînes. Ph.D. thesis, Univeristé de Paris-Sud (1977)
Hagendorf, J.G.: Extensions respectueuses de chaînes. Z. Math. Log. Grundl. Math. 25(5), 423–444 (1979)
Jullien, P.: Contribution à l’étude des types d’ordre dispersés. Ph.D. thesis, Marseille (1969)
Laver, R.: On Fraïssé’s order type conjecture. Ann. Math. 93(2), 89–111 (1971)
Montalbán, A.: On the equimorphism types of linear orderings. Bull. Symb. Log. (to appear)
Montalbán, A.: Equivalence between Fraïssé’s conjecture and Jullien’s theorem. Ann. Pure Appl. Logic 139, 1–42 (2006)
Rosenstein, J.: Linear Orderings. Academic Press, New York (1982)
Shore, R.A.: On the strength of Fraïssé’s conjecture. In: Logical Methods (Ithaca, NY, 1992). Progress in Computer Science and Applied Logic, vol. 12, pp. 782–813. Birkhäuser, Boston, MA (1993)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by NSF grant DMS-0600824.
Rights and permissions
About this article
Cite this article
Montalbán, A. Countably Complementable Linear Orderings. Order 23, 321–331 (2006). https://doi.org/10.1007/s11083-006-9049-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-006-9049-6