Search results
Appearance
There is a page named "Talk:Transitive closure" on Wikipedia
- an algorithm, that, given a transitive relation T, will return the smallest relation R such that the transitive closure of R is T? Is there such a smallest...19 KB (2,853 words) - 05:31, 9 March 2024
- not transitive iff ∈ is transitive on A. Example 1: A={0,{0},{{0}}} is a transitive set, but ∈ is not transitive on A. Example 2: ∈ is transitive on A={{0}}...15 KB (2,198 words) - 09:55, 10 February 2024
- S is the transitive closure): If S is antisymmetric, then the reduction is unique, if it exists. If S is locally finite then the transitive reduction...6 KB (859 words) - 09:55, 10 February 2024
- transitive closure, and remove orientation." Why do I need to apply transitive closure, I though the partial order over the set is already transitive...6 KB (857 words) - 21:53, 30 January 2024
- ...a set is called hereditarily countable if and only if its transitive closure is a countable set. If the axiom of countable choice holds, then a set...1 KB (186 words) - 01:08, 9 March 2024
- isomorphism between (ω,E) and (X, ∈ {\displaystyle \in } ) where X is the transitive closure of {x}. with this In set theory a code of a set is defined as follows...2 KB (257 words) - 18:37, 30 January 2024
- transitive closure" (meanwhile?) refers to the very same article it starts from; it should be adjusted or deleted. Similar for "reflexive transitive symmetric...20 KB (3,072 words) - 23:51, 8 March 2024
- and to reinforce the message that DAGs are conceptually powerful. Transitive closure is another case where a diagram might do all those things: the Hasse...14 KB (1,521 words) - 23:40, 10 July 2020
- Talk:Eclipse Buckminster (section Transitively)my attempt to describe how it finds needed components to achieve transitive closure without being inaccurate or excessively complicated? RJFJR (talk)...1 KB (154 words) - 06:09, 17 January 2024
- satisfies φ(y) (i.e. with quantifiers restricted to A) for every y in the transitive closure of {x} (which is a subset of A). If B=A, then we are done. Otherwise...10 KB (1,473 words) - 19:56, 4 February 2024
- definition given (which is more common in social choice) is similar to transitive closure in reverse. I'll try to explain this better when I think of a way...10 KB (1,581 words) - 03:51, 9 March 2024
- theories is to define that A is a hereditary xxx iff every object in the transitive closure of {A} is a xxx (note that this is equivalent to the inductive definition...3 KB (447 words) - 01:08, 9 March 2024
- the existential quantifier in the right place? Doesn't non-transitive mean "not transitive"? Do you have a reference? --Sam Staton 13:08, 28 August 2007...7 KB (1,277 words) - 18:13, 29 August 2007
- (If memory serves, they dealt on the 'value webs' that are the transitive closures of ud- and du-chains, which is the same information as managed in...765 bytes (76 words) - 13:43, 2 February 2024
- comes to mind when given a general reduction relation is its transitive reflexive closure, but the “diamond property” for this preorder amounts to confluence...3 KB (555 words) - 04:00, 1 February 2024
- meant by "extending by transitivity"? Does it mean transitive closure? Do we also have to do some kind of "symmetric closure" to make this relation symmetric...26 KB (4,236 words) - 20:44, 29 May 2024
- are sufficient to recover the original by reachability extension (transitive closure). It is more natural to draw them this way, and cycles are much clearer...24 KB (3,577 words) - 03:20, 14 April 2024
- sentence explaining that the term R-ancestor is derived from taking the transitive closure of the parent relation as an example, but gave up when I could not...2 KB (376 words) - 12:58, 18 June 2024
- not considering that Hasse diagrams are understood to denote the transitive closure of what they actually depict, so I thought the strict-part requirement...4 KB (557 words) - 03:38, 9 March 2024
- properties of the elements should be as similar as possible (their transitive closures should have a similar structure as graphs); perhaps, we should eliminate...4 KB (552 words) - 16:50, 24 January 2024