Encyclopedia.com > Dictionaries, Thesauruses, Pictures, and Press Releases > A Dictionary of Computing > January 2004

idempotent law

A Dictionary of Computing | 2004 | 256 words | Copyright

idempotent law The law satisfied by any dyadic operation ◦ for which x ◦ x = x

for all elements x in the domain of ◦. Union and intersection of sets satisfy these laws. In a Boolean algebra both of the dyadic operations are idempotent.

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

JOHN DAINTITH. "idempotent law." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "idempotent law." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-idempotentlaw.html

JOHN DAINTITH. "idempotent law." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-idempotentlaw.html

Learn more about citation styles

Find thousands of answers for hundreds of subjects at Answers Encyclopedia .

All answers verified by trusted sources at Encyclopedia.com

Try Answers Encyclopedia now!

For students and teachers!

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including:

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including: