Relational Closure and the Rank Function
In this section we introduce two ideas important for the work to follow. The first of these is relational closure. In later sections we will be especially interested in sets that are transitive. While there exist sets that are not transitive every set has a transitive extension. Indeed, every set has a smallest transitive extension which we call its transitive closure.
KeywordsRelational Closure Induction Hypothesis Weak Form Binary Relation Nonempty Subset
Unable to display preview. Download preview PDF.