Order isomorphism

id: order-isomorphism-272-8352018
title: Order isomorphism
text: In the mathematical field of order theory, an order isomorphism is a special kind of monotone function that constitutes a suitable notion of isomorphism for partially ordered sets (posets). Whenever two posets are order isomorphic, they can be considered to be "essentially the same" in the sense that either of the orders can be obtained from the other just by renaming of elements. Two strictly weaker notions that relate to order isomorphisms are order embeddings and Galois connections.
brand slug: wiki
category slug: encyclopedia
description: Equivalence of partially ordered sets
original url: https://en.wikipedia.org/wiki/Order_isomorphism
date created:
date modified: 2022-12-15T20:41:27Z
main entity: {"identifier":"Q997521","url":"https://www.wikidata.org/entity/Q997521"}
image:
fields total: 13
integrity: 14

Related Entries

Explore Next Part