Order isomorphism

Related Topics

Galois connections
Mathematics
Monotonic
Partially ordered set
Isomorphic
Order embedding
Order theory

About this page

The research on this page is brought to you by Taylor & Francis Knowledge Centers. This collection is automatically generated from our most recent books and journals on this topic.

Explore chapters and articles related to this topic

Lattices and Boolean Algebra

View Chapter

Purchase Book

Published in B. V. Senthil Kumar, Hemen Dutta, Discrete Mathematical Structures, 2019

B. V. Senthil Kumar, Hemen Dutta

Definition 5.3.25 Order-isomorphic Partially Ordered Sets:Two partially ordered sets 〈P, ≤〉 and 〈Q, ≤′〉 are called order-isomorphic if there exists a mapping f : P → Q which is bijective and if both f and f−1are order-preserving.

On pattern setups and pattern multistructures

View Article

Journal Information

Published in International Journal of General Systems, 2020

Aimene Belfodil, Sergei O. Kuznetsov, Mehdi Kaytoue

If there is an order-embedding from to , then poset is said to be a completion of or embeds. If this order-embedding is surjective (i.e. an order-isomorphism) we say that and are order-isomorphic.