A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The class of partial orders is shown to have Ol laws for first-order logic and for inductive fixed-point logic, a logic which properly contains first-order logic. This means that for every sentence in one of these logics the proportion of labeled (or unlabeled) partial orders of size n satisfying the sentence has a limit of either 0 or 1 as n goes to co. This limit, called the asymptotic probability of the sentence, is the same for labeled and unlabeled structures. The computational complexitydoi:10.1016/0890-5401(88)90032-6 fatcat:nd272a33kvg3th4jygy4k3y5ku