Search results

Page title matches

Idempotence
In [[mathematics]] and [[computer science]] '''idempotence''' is the property of an operation that repeated application has no further

2 KB (242 words) - 13:20, 18 November 2022
Idempotence/Definition

105 bytes (14 words) - 16:25, 19 December 2008
Idempotence/Bibliography

733 bytes (88 words) - 02:34, 24 December 2008
Idempotence/Related Articles

902 bytes (142 words) - 14:48, 23 December 2008

Transaction processing/Related Articles
{{r|Idempotence}}

506 bytes (63 words) - 21:04, 11 January 2010
Function composition/Related Articles
{{r|Idempotence}}

749 bytes (92 words) - 16:43, 11 January 2010
Database/Related Articles
{{r|Idempotence}}

965 bytes (125 words) - 15:51, 11 January 2010
Idempotent element
An [[idempotence|idempotent]] binary operation is one for which every element is an idempote

1,007 bytes (146 words) - 16:14, 13 December 2008
Interior (topology)
* Interior is [[idempotence|idempotent]]: <math>A^{{\circ}{\circ}} = A^{\circ}</math>.

1 KB (172 words) - 15:44, 7 February 2009
Closure (topology)
* Closure is [[idempotence|idempotent]]: <math>\overline{\overline A} = \overline A</math>.

1 KB (184 words) - 15:20, 6 January 2009
Serge Lang/Related Articles
{{r|Idempotence}}

1 KB (187 words) - 20:18, 11 January 2010
Idempotence
In [[mathematics]] and [[computer science]] '''idempotence''' is the property of an operation that repeated application has no further

2 KB (242 words) - 13:20, 18 November 2022
Computer science/Related Articles
{{r|Idempotence}}

3 KB (353 words) - 03:48, 24 September 2013
Extreme value
* [[Idempotence]]: <math>x \vee x = x = x \wedge x ; \,</math>

3 KB (538 words) - 18:17, 17 January 2010
Order (relation)
* [[Idempotence]]: <math>x \vee x = x = x \wedge x ; \,</math>

11 KB (1,918 words) - 18:23, 17 January 2010