Surjectively rigid chains

&
Mathematical Logic Quarterly 66 (4):466-478 (2020)
  Copy   BIBTEX

Abstract

We study rigidity properties of linearly ordered sets (chains) under automorphisms, embeddings, epimorphisms, and endomorphisms. We focus on two main cases: dense subchains of the real numbers, and uncountable dense chains of higher regular cardinalities. We also give a Fraenkel‐Mostowski model which illustrates the role of the axiom of choice in one of the key proofs.

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.202000014

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,885

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The axiom of choice for well-ordered families and for families of well- orderable sets.Paul Howard & Jean E. Rubin - 1995 - Journal of Symbolic Logic 60 (4):1115-1117.
A class of higher inductive types in Zermelo‐Fraenkel set theory.Andrew W. Swan - 2022 - Mathematical Logic Quarterly 68 (1):118-127.
Models of $${{\textsf{ZFA}}}$$ in which every linearly ordered set can be well ordered.Paul Howard & Eleftherios Tachtsis - 2023 - Archive for Mathematical Logic 62 (7):1131-1157.
Stable theories without dense forking chains.Bernhard Herwig, James G. Loveys, Anand Pillay, Predag Tanović & O. Wagner - 1992 - Archive for Mathematical Logic 31 (5):297-303.
Linear orders realized by C.e. Equivalence relations.Ekaterina Fokina, Bakhadyr Khoussainov, Pavel Semukhin & Daniel Turetsky - 2016 - Journal of Symbolic Logic 81 (2):463-482.
Non-constructive Properties of the Real Numbers.J. E. Rubin, K. Keremedis & Paul Howard - 2001 - Mathematical Logic Quarterly 47 (3):423-431.
Properties of the real line and weak forms of the Axiom of Choice.Omar De la Cruz, Eric Hall, Paul Howard, Kyriakos Keremedis & Eleftherios Tachtsis - 2005 - Mathematical Logic Quarterly 51 (6):598-609.
The dense linear ordering principle.David Pincus - 1997 - Journal of Symbolic Logic 62 (2):438-456.
Fields with a dense-codense linearly independent multiplicative subgroup.Alexander Berenstein & Evgueni Vassiliev - 2020 - Archive for Mathematical Logic 59 (1-2):197-228.
On dividing chains in simple theories.Steffen Lewitzka & Ruy J. G. B. De Queiroz - 2005 - Archive for Mathematical Logic 44 (7):897-911.

Analytics

Added to PP
2021-01-16

Downloads
20 (#1,119,193)

6 months
4 (#979,456)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

On o-amorphous sets.P. Creed & J. K. Truss - 2000 - Annals of Pure and Applied Logic 101 (2-3):185-226.

Add more references