Siblings of direct sums of chains

Archive for Mathematical Logic:1-15 (forthcoming)
  Copy   BIBTEX

Abstract

We prove that a countable direct sum of chains has one, countably many or else continuum many isomorphism classes of siblings. This proves Thomassé’s conjecture for such structures. Further, we show that a direct sum of chains of any cardinality has one or infinitely many siblings, up to isomorphism.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,319

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2025-03-20

Downloads
1 (#1,960,452)

6 months
1 (#1,599,157)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Counting Siblings in Universal Theories.Samuel Braunfeld & Michael C. Laskowski - 2022 - Journal of Symbolic Logic 87 (3):1130-1155.
Equimorphy: the case of chains.C. Laflamme, M. Pouzet & R. Woodrow - 2017 - Archive for Mathematical Logic 56 (7-8):811-829.

Add more references