In many applications it is usual to represent a truth function by a [[boolean function]], that is, a function of the form <math>f : \mathbb{B}^k \to \mathbb{B},</math> where <math>k\!</math> is a non-negative integer and <math>\mathbb{B}</math> is the [[boolean domain]] <math>\{ 0, 1 \}.\!</math> In most applications the lo<math>\operatorname{false}</math> is represented by <math>0\!</math> and <math>\operatorname{true}</math> is represented by <math>1\!</math> but the opposite representation is also possible, depending on the overall representation of truth functions as boolean functions. The remainder of this article assumes the usual representation, taking the equations <math>\operatorname{F} = 0</math> and <math>\operatorname{T} = 1</math> for granted. | In many applications it is usual to represent a truth function by a [[boolean function]], that is, a function of the form <math>f : \mathbb{B}^k \to \mathbb{B},</math> where <math>k\!</math> is a non-negative integer and <math>\mathbb{B}</math> is the [[boolean domain]] <math>\{ 0, 1 \}.\!</math> In most applications the lo<math>\operatorname{false}</math> is represented by <math>0\!</math> and <math>\operatorname{true}</math> is represented by <math>1\!</math> but the opposite representation is also possible, depending on the overall representation of truth functions as boolean functions. The remainder of this article assumes the usual representation, taking the equations <math>\operatorname{F} = 0</math> and <math>\operatorname{T} = 1</math> for granted. |