scrambled
Home//Concepts/Transitive
scrambled
Overviewjust now
154
2
4
1082
3
2
24
633
Dimensional inference rule formatjust nowAbstract binding graphjust nowAbstract binding tree abtjust nowAbstract binding tree abt valence abstractorjust nowAbstract data typejust now
408
11
4
Overviewjust now
154
2
4
1082
3
2
24
633
Dimensional inference rule formatjust nowAbstract binding graphjust nowAbstract binding tree abtjust nowAbstract binding tree abt valence abstractorjust nowAbstract data typejust now
408
11
4
Concept

Transitive

Modified just now
Books
  • Chapter 2. Mathematical preliminaries
JourneyProgramming Language Theory Statusmastered Tags
  • set-theory-relation

A property of a Binary relation RRR on a set TTT such that if t0 R t1t_0\ R\ t_1t0​ R t1​ and t1 R t2t_1\ R\ t_2t1​ R t2​ then t0 R t2t_0\ R\ t_2t0​ R t2​, for every t0t_0t0​, t1t_1t1​, t2t_2t2​ ∈T\in T∈T.

Previous in ConceptsTransition functionNext in Concepts Transitive closure
Books
  • Chapter 2. Mathematical preliminaries
JourneyProgramming Language Theory
Statusmastered
Tags
  • set-theory-relation