- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Linear orders: When embeddability and epimorphism agree
Journal of Mathematical Logic 19 (1):1950003 (2019)
Abstract
When a linear order has an order preserving surjection onto each of its suborders, we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is a [Formula: see text]-complete set. Using hypotheses beyond ZFC, we prove the existence of uncountable strongly surjective orders.Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Coloring linear orders with Rado's partial order.Riccardo Camerlo & Alberto Marcone - 2007 - Mathematical Logic Quarterly 53 (3):301-305.
The complexity of the collection of countable linear orders of the form I + I.Ferenc Beleznay - 1999 - Journal of Symbolic Logic 64 (4):1519-1526.
On countably saturated linear orders and certain class of countably saturated graphs.Ziemowit Kostana - 2020 - Archive for Mathematical Logic 60 (1):189-209.
The Complexity of the Collection of Countable Linear Orders of the Form I + I.Ferenc Beleznay - 1999 - Journal of Symbolic Logic 64 (4):1519-1526.
Nonexistence of universal orders in many cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.
On cuts in ultraproducts of linear orders I.Mohammad Golshani & Saharon Shelah - 2016 - Journal of Mathematical Logic 16 (2):1650008.
On Fraïssé’s conjecture for linear orders of finite Hausdorff rank.Alberto Marcone & Antonio Montalbán - 2009 - Annals of Pure and Applied Logic 160 (3):355-367.
Temporal logic of surjective bounded morphisms between finite linear processes.David Gabelaia, Evgeny Kuznetsov, Radu Casian Mihailescu, Konstantine Razmadze & Levan Uridia - 2023 - Journal of Applied Non-Classical Logics 34 (1):1-30.
The complexity of Scott sentences of scattered linear orders.Rachael Alvir & Dino Rossegger - 2020 - Journal of Symbolic Logic 85 (3):1079-1101.
The complexity of continuous embeddability between dendrites.Alberto Marcone & Christian Rosendal - 2004 - Journal of Symbolic Logic 69 (3):663-673.
Analytics
Added to PP
2018-11-17
Downloads
16 (#934,417)
6 months
8 (#415,703)
2018-11-17
Downloads
16 (#934,417)
6 months
8 (#415,703)
Historical graph of downloads
Citations of this work
Polish metric spaces with fixed distance set.Riccardo Camerlo, Alberto Marcone & Luca Motto Ros - 2020 - Annals of Pure and Applied Logic 171 (10):102832.
References found in this work
Indecomposable linear orderings and hyperarithmetic analysis.Antonio Montalbán - 2006 - Journal of Mathematical Logic 6 (1):89-120.
Wadge hierarchy of differences of co-analytic sets.Kevin Fournier - 2016 - Journal of Symbolic Logic 81 (1):201-215.
Baumgartner’s isomorphism problem for $$\aleph _2$$ ℵ 2 -dense suborders of $$\mathbb {R}$$ R.Justin Tatch Moore & Stevo Todorcevic - 2017 - Archive for Mathematical Logic 56 (7-8):1105-1114.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-sz9d2 uwo