Defining (reflexive) transitive closure on finite models

Abstract

Let R be a binary relation on some domain. Use R∗ for the reflexive transitive closure of R, i.e., the smallest binary relation S with R ⊆ S that is reflexive and transitive. Use R+ for the transitive closure of R, i.e., the smallest binary relation S with R ⊆ S that is transitive. Use I for the identity relation on the domain. Let n range over natural numbers. Define Rn as follows, by induction: R0 := I Rn+1 := R ◦ R..

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2009-01-28

Downloads
24 (#659,238)

6 months
1 (#1,475,652)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jan Van Eijck
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references