A poset can be represented by a directed graph where there is 0 or 1 (but not more than one) arrows between the nodes.
For example if we have a relation between two elements 'p' and 'q':
p >= q  Then we write an arrow  p →q 
A poset can be represented by a directed graph where there is 0 or 1 (but not more than one) arrows between the nodes.
For example if we have a relation between two elements 'p' and 'q':
p >= q  Then we write an arrow  p →q 
metadata block 

see also:  
Correspondence about this page  
Book Shop  Further reading. Where I can, I have put links to Amazon for books that are relevant to the subject, click on the appropriate country flag to get more details of the book or to buy it from them. 

Terminology and Notation Specific to this page here: 

This site may have errors. Don't use for critical systems.
Copyright (c) 19982017 Martin John Baker  All rights reserved  privacy policy.