View source for Partially-ordered set

Partially-ordered sets ([[POSet]]) are composed of directed relations, similar to a tuple whose data entries' ordered relations is a crucial aspect of information encoding. According to Data Scott<ref>{{:Paper/Outline of a Mathematical Theory of Computation}}</ref>, a [[Partially-ordered set]], also known as: [[POSet]], is the most universal building block for the theory of computation. In other words, it is the data representation of [[Universal abstraction]].

=[[Lattice]]:A Special kind of [[POSet]]=
One should also notice that there is a special kind of [[POSet]], called [[Lattice]]. A [[lattice]] is a POSet with a unique [[Top]] and a unique [[Bottom]].

=Critical Revelation in Programming=
Knowing that [[POSet]] is a universal data structure, that means all programs are some variants of [[POSet]]. The most important reason for knowing this must be true, is due to the single direction of time flow. 
 All events must be somehow ordered in '''[[Time|time]]'''. Therefore, they must all be placed in a [[Partially ordered set]].
This single-minded idea allows one to think of all algorithms in terms of traversing some [[POSet]], or in an other word:[[Tree]]. This revelation helps us to see that all databases should be managed in terms of some kind of [[POSet]], and therefore, should be taught and programmed accordingly.


<noinclude>

=References=
<references/>

==Related Pages==

[[Category:Tree]]
[[Category:Time]]
</noinclude>