What is a nested partially ordered set?
A nested partially ordered set is a partially ordered set with elements that can be themselves partially ordered sets. Thus any element of a nested partially ordered set has a superset where it exists and simultaniously it has many greater elements. Alternatively, a nested partially ordered set can be viewed as a nested set with a partial order defined on them. Additionally, a nested partially ordered set has to satisfy a condition which is called syntactic constraint.