Advertisement

Relational Closure and the Rank Function

  • Gaisi Takeuti
  • Wilson M. Zaring
Part of the Graduate Texts in Mathematics book series (GTM, volume 1)

Abstract

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.

Keywords

Relational Closure Induction Hypothesis Weak Form Binary Relation Nonempty Subset 
These 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1971

Authors and Affiliations

  • Gaisi Takeuti
    • 1
  • Wilson M. Zaring
    • 1
  1. 1.University of IllinoisUSA

Personalised recommendations