Search results
Jump to navigation
Jump to search
Page title matches
- In [[set theory]], a '''transitive relation''' on a [[set (mathematics)|set]] is a [[relation (mathematics)|relation]] ...ne always exists, namely the always-true relation): loosely the "smallest" transitive relation containing ''R''. The closure may also be constructed as2 KB (295 words) - 14:28, 6 February 2009
- 12 bytes (1 word) - 14:27, 6 February 2009
- 100 bytes (18 words) - 11:26, 31 December 2008
- | pagename = transitive relation | abc = transitive relation2 KB (226 words) - 09:33, 15 March 2024
- Auto-populated based on [[Special:WhatLinksHere/Transitive relation]]. Needs checking by a human.515 bytes (63 words) - 21:04, 11 January 2010
Page text matches
- In [[set theory]], a '''transitive relation''' on a [[set (mathematics)|set]] is a [[relation (mathematics)|relation]] ...ne always exists, namely the always-true relation): loosely the "smallest" transitive relation containing ''R''. The closure may also be constructed as2 KB (295 words) - 14:28, 6 February 2009
- {{r|Transitive relation}}501 bytes (62 words) - 19:58, 11 January 2010
- * ''R'' is ''[[transitive relation|transitive]]'' if <math>(x,y), (y,z) \in R \Rightarrow (x,z)</math>; that i4 KB (684 words) - 11:25, 31 December 2008
- {{r|Transitive relation||**}}155 bytes (20 words) - 11:01, 31 May 2009
- Auto-populated based on [[Special:WhatLinksHere/Transitive relation]]. Needs checking by a human.515 bytes (63 words) - 21:04, 11 January 2010
- | pagename = transitive relation | abc = transitive relation2 KB (226 words) - 09:33, 15 March 2024
- {{r|Transitive relation}}2 KB (247 words) - 17:28, 11 January 2010
- ...a [[Order (relation)#Partial order|preorder]] (that is, a reflexive and [[Transitive relation|transitive]] relation), and "be isomorphic" is an [[equivalence relation]].6 KB (944 words) - 08:32, 14 October 2013
- ...a [[Order (relation)#Partial order|preorder]] (that is, a reflexive and [[Transitive relation|transitive]] relation), and "be isomorphic" is an [[equivalence relation]].6 KB (944 words) - 15:09, 23 September 2013
- A reflexive and transitive relation is called a '''preorder'''. In a preorder the relation defined by <math>x \11 KB (1,918 words) - 18:23, 17 January 2010
- {{rpl|Transitive relation}}5 KB (628 words) - 04:35, 22 November 2023
- ...d transitive relation)" --> "is a preorder (that is, '''a''' reflexive and transitive relation)".11 KB (1,773 words) - 07:06, 20 September 2011
- ...C will also be in thermal equilibrium (being in thermal equilibrium is a [[transitive relation]]; moreover, it is an [[equivalence relation]]). This is an empirical fact,23 KB (3,670 words) - 05:52, 15 March 2024
- ...ll in communion with Canterbury (this is what we mathematicians call a non-transitive relation). Similarly, in the case in point, after the above-mentioned schisms, there142 KB (23,494 words) - 11:56, 29 September 2011