Transitive closure
In mathematics, the transitive closure of a binary relation R on a set X is the smallest relation on X that contains R and is transitive. For finite sets, "smallest" can be taken in its usual sense, of having the fewest related pairs; for infinite sets it is the unique minimal transitive superset of R. Conversely, transitive reduction adduces a minimal relation S from a given relation R such that they have the same closure, that is, S+ = R+; however, many different S with this property may exist.
Wikipage disambiguates
2-satisfiabilityAbstract family of acceptorsAbstract rewriting systemActor model theoryAcyclic orientationAlgorithms for computing transitive closureAnalytic continuationAncestral relationB-PrologBinary relationBirkhoff's representation theoremClosureClosure (mathematics)Codd's theoremCommon knowledge (logic)Comparability graphContext-free grammarCycDescription logicDescriptive ComplexityDescriptive complexity theoryDirected acyclic graphDynamic epistemic logicExpressive power (computer science)FO (complexity)Finite-state transducerFinite model theoryFixed-point combinatorFlix (programming language)Floyd–Warshall algorithmGlossary of graph theoryGlossary of order theoryGlossary of set theoryGraphQLHiLogHierarchical and recursive queries in SQLHypergraphIncremental computingIndex of philosophy articles (R–Z)Integer set library
Link from a Wikipage to another Wikipage
primaryTopic
Transitive closure
In mathematics, the transitive closure of a binary relation R on a set X is the smallest relation on X that contains R and is transitive. For finite sets, "smallest" can be taken in its usual sense, of having the fewest related pairs; for infinite sets it is the unique minimal transitive superset of R. Conversely, transitive reduction adduces a minimal relation S from a given relation R such that they have the same closure, that is, S+ = R+; however, many different S with this property may exist.
has abstract
De transitieve afsluiting (Ned ...... orde op de verzameling knopen.
@nl
Domknięcie przechodnie relacji ...... echodnich na ją zawierających.
@pl
In mathematics, the transitive ...... related area of graph theory.
@en
La clausura transitiva o cierr ...... existe su clausura transitiva.
@es
La fermeture transitive est un ...... dit sur des graphes orientés.
@fr
Matematikan, multzoan definitu ...... ra: iragankorra bada, orduan .
@eu
Na matemática, o fecho transit ...... x para y em um ou mais voos."
@pt
Tranzitivní uzávěr binární rel ...... věr R' binární relace R platí:
@cs
Транзитивне замикання бінарног ...... і R1 вважатимемо меншим за R2.
@uk
Транзитивное замыкание в теори ...... придётся лететь с пересадками)
@ru
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,013,301,423
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
De transitieve afsluiting (Ned ...... eeft een transitieve sluiting.
@nl
Domknięcie przechodnie relacji ...... echodnich na ją zawierających.
@pl
In mathematics, the transitive ...... with this property may exist.
@en
La clausura transitiva o cierr ...... existe su clausura transitiva.
@es
La fermeture transitive est un ...... dit sur des graphes orientés.
@fr
Matematikan, multzoan definitu ...... ra: iragankorra bada, orduan .
@eu
Na matemática, o fecho transit ...... x para y em um ou mais voos."
@pt
Tranzitivní uzávěr binární rel ...... věr R' binární relace R platí:
@cs
Транзитивне замикання бінарног ...... і R1 вважатимемо меншим за R2.
@uk
Транзитивное замыкание в теори ...... придётся лететь с пересадками)
@ru
label
Clausura transitiva
@es
Domknięcie przechodnie
@pl
Fecho transitivo
@pt
Fermeture transitive
@fr
Itxitura iragankor
@eu
Transitieve afsluiting
@nl
Transitive Hülle (Relation)
@de
Transitive closure
@en
Tranzitivní uzávěr
@cs
Транзитивне замикання
@uk