Restriction respectueuse et reconstruction Des chaines et Des relations infinites

Mathematical Logic Quarterly 38 (1):457-490 (1992)
  Copy   BIBTEX

Abstract

We show a faithful restriction theorem among infinite chains which implies a reconstructibility conjecture of Halin. This incite us to study the reconstructibility in the sense of Fraïssé and to prove it for orders of cardinality infinite or ≥ 3 and for multirelations of cardinality infinite or ≥ 7, what improves the theory obtained by G. Lopez in the finite case. For this work we had to study the infinite classes of difference which have to be a linear order of type ω, ω* or ω* + ω; this complete the theory made by G. Lopez for the finite case . We show also Ulam-reconstructibility for linear orders which have a fixed point

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,533

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

Some Ramsey theory in Boolean algebra for complexity classes.Gregory L. McColm - 1992 - Mathematical Logic Quarterly 38 (1):293-298.
Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Supplements of bounded permutation groups.Stephen Bigelow - 1998 - Journal of Symbolic Logic 63 (1):89-102.
Ω-powers and descriptive set theory.Dominique Lecomte - 2005 - Journal of Symbolic Logic 70 (4):1210-1232.

Analytics

Added to PP
2013-12-01

Downloads
20 (#922,075)

6 months
4 (#1,145,416)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.

Add more references