On transitive subrelations of binary relations

Journal of Symbolic Logic 76 (4):1429-1440 (2011)
  Copy   BIBTEX

Abstract

The transitive closure of a binary relation R can be thought of as the best possible approximation of R "from above" by a transitive relation. We consider the question of approximating a relation from below by transitive relations. Our main result is that every thick relation (a relation whose complement contains no infinite chain) on a countable set has a transitive thick subrelation. This allows for a solution to a problem arising from previous work by the author and Alan Taylor. We also exhibit a thick relation on an uncountable set with no transitive thick subrelation

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2011-10-12

Downloads
23 (#704,854)

6 months
1 (#1,516,001)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Book Reviews. [REVIEW]Wilfrid Hodges - 1997 - Studia Logica 64 (1):133-149.

Add more references