Premium
RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES
Author(s) -
Hagendorf Jean Guillaume,
Hagendorf J. G.
Publication year - 1992
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19920380143
Subject(s) - mathematics , cardinality (data modeling) , conjecture , combinatorics , discrete mathematics , data mining , computer science
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 ([13]). We show also Ulam‐reconstructibility for linear orders which have a fixed point.