Recommendations
Cites work
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- Extensions Respectueuses de Chaines
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 3786843 (Why is no real title available?)
- scientific article; zbMATH DE number 3552546 (Why is no real title available?)
- scientific article; zbMATH DE number 749940 (Why is no real title available?)
- scientific article; zbMATH DE number 3052455 (Why is no real title available?)
- On Fraissé's order type conjecture
- On the Equimorphism Types of Linear Orderings
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
Cited in
(13)- Extending partial orders to dense linear orders
- Countable linear orders with disjoint infinite intervals are mutually orthogonal
- Faithful extensions on finite orders classes
- Countably categorical coloured linear orders
- scientific article; zbMATH DE number 5652506 (Why is no real title available?)
- Countable homogeneous linearly ordered posets
- Faithful extension on finite order classes
- The Complexity of the Collection of Countable Linear Orders of the form I + I
- The strength of compactness for countable complete linear orders
- Linear orders: when embeddability and epimorphism agree
- LATIN 2004: Theoretical Informatics
- A coding of the countable linear orderings
- Epimorphisms between linear orders.
This page was built for publication: Countably complementable linear orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878148)
