In Boolean algebra and in the design of switching networks is a Implicant a Boolean function a Boolean term, which is always true if is true.
![f](https://wikimedia.org/api/rest_v1/media/math/render/svg/132e57acb643253e7810ee9702d9581f159a1c61)
![f](https://wikimedia.org/api/rest_v1/media/math/render/svg/132e57acb643253e7810ee9702d9581f159a1c61)
![m](https://wikimedia.org/api/rest_v1/media/math/render/svg/0a07d98bb302f3856cbabc47b2b9016692e3f7bc)
definition
Be a boolean function.
![{\ displaystyle f \ colon \ {0,1 \} ^ {n} \ rightarrow \ {0,1 \}, \, (x_ {1}, \ dotsc, x_ {n}) \ mapsto f (x_ {1 }, \ dotsc, x_ {n})}](https://wikimedia.org/api/rest_v1/media/math/render/svg/823f33903e4791cac9be956f6bdce8b2d89e093f)
A Boolean term is called implicant if and only if holds![m](https://wikimedia.org/api/rest_v1/media/math/render/svg/0a07d98bb302f3856cbabc47b2b9016692e3f7bc)
![f](https://wikimedia.org/api/rest_v1/media/math/render/svg/132e57acb643253e7810ee9702d9581f159a1c61)
.
Web links
-
Implicant (Lexicon of Mathematics - Spectrum of Science)