RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES

DOI10.1002/malq.19920380143zbMath0795.05103OpenAlexW2058216221MaRDI QIDQ4295246

Jean Guillaume Hagendorf

Publication date: 11 July 1994

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19920380143

zbMATH Keywords

linear orderschainreconstructionrelation

Mathematics Subject Classification ID

Total orders (06A05) Other classical set theory (including functions, relations, and set algebra) (03E20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Prime orders all of whose prime suborders are selfdual ⋮ \((\leq k)\)-reconstructible binary relations ⋮ Finite orders which are reconstructible up to duality by their comparability graphs ⋮ What is reconstruction for ordered sets?

This page was built for publication: RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES