Abstract
Modelling non-sequential processes by partially ordered sets (posets) leads to the concept of K-density which says that every cut and every line have (exactly) one point in common. The “simplest” example of non-K-density is given by a four-element poset the underlying graph of wich is “N-shaped”; a poset is called N-dense iff every (four-element) N-shaped subposet can be extended to an K-dense subposet by addition of one point. K-density implies N-density; for finite non-empty posets also the converse implication is true. It turns out that much weaker properties are sufficient; especially, it will be proved that an N-dense non-empty poset is K-dense if all cuts are finite.KeywordsMaximal ChainInfinite ChainPreceding TheoremFiniteness PropertyCausal DependencyThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
