MyWikiBiz, Author Your Legacy — Monday November 18, 2024
Jump to navigationJump to search
118 bytes added
, 13:02, 16 May 2012
Line 1: |
Line 1: |
| <font size="3">☞</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]]. | | <font size="3">☞</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]]. |
| | | |
− | A '''truth table''' is a tabular array that illustrates the computation of a '''truth function''', that is, a function of the form <math>f : \mathbb{A}^k \to \mathbb{A},</math> where <math>k\!</math> is a non-negative integer and <math>\mathbb{A}</math> is the '''truth value domain''' <math>\{ \operatorname{false}, \operatorname{true} \},</math> commonly abbreviated as <math>\{ \operatorname{F}, \operatorname{T} \}.</math> | + | A '''truth table''' is a tabular array that illustrates the computation of a ''logical function'', that is, a function of the form <math>f : \mathbb{A}^k \to \mathbb{A},</math> where <math>k\!</math> is a non-negative integer and <math>\mathbb{A}</math> is the domain of logical values <math>\{ \operatorname{false}, \operatorname{true} \},</math> the names of whose elements are commonly abbreviated in accord with the equations <math>\operatorname{F} = \operatorname{false}</math> and <math>\operatorname{T} = \operatorname{true}</math> |
| | | |
− | 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 <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. |
| | | |
| ==Logical negation== | | ==Logical negation== |