|
|
| Line 1: |
Line 1: |
| <!-- :'''Truth functional' redirects here. For the truth functional conditional, see [[Material conditional]].''
| | All of the trophies from all in the members in your kin get added up and furthermore divided by 2 to ascertain your clans overall medals. Playing many different kinds of games could make your gaming time more pleasurable. and your league also determines some battle win bonus. 5 star rating and is known to be real addictive as players are recognized to devote several hours enjoying the game. She makes a speciality of beauty salon business manufacturing and client fascination.<br><br> |
| IMHO by no means the material conditional may not be referred to or abbreviated as the adjective "truth functional", omitting a noun like "conditional" or "implication". Seems more like an internal link spamming rather than an appropriate dab hatnote. --Incnis Mrsi -->
| |
| In [[mathematical logic]], a '''truth function''' is a [[function (mathematics)|function]] from a [[set (mathematics)|set]] of [[truth value]]s{{clarify|date=March 2012}}<!-- what about arity? --> to truth values. Classically the [[domain of a function|domain]] and [[range (mathematics)|range]] of a truth function are {''[[truth]]'', ''[[false (logic)|falsehood]]''}, but they may have any number of truth values, including an infinity of these.{{citation needed|date=August 2012}}
| |
|
| |
|
| A [[logical connective]] is truth-functional if the truth-value of a compound sentence is a function of the truth-value of its sub-sentences. A class of connectives is truth-functional if each of its members is. For example, the connective "''and''" is truth-functional since a sentence like "''Apples are fruits and carrots are vegetables''" is true just in case each of its sub-sentences "''apples are fruits''" and "''carrots are vegetables''" is true, and it is false otherwise. Not all connectives of a natural language, such as English, are truth-functional.
| | Host a video game contest. These can be a lot on fun for you together gaming friends. Either you do this online, in the house or at a colleguerrrs place. Serve amazing snacks and get since many people as you can involved. If you have any kind of concerns pertaining to where and how you can utilize how to hack clash of clans ([http://circuspartypanama.com More Material]), you could call us at the web-page. This makes agreat way to enjoy one's own game playing with family.<br><br>A single clash of clans hack equipment so tricks could be skillfully handy in the labor that you are a passionate player of the disruption. The finest hack apparatuses tackle just around any doing work by using - Android and Apple inc iOS. You also can exploit the obtain that you can use on your apple new iphone 4 or Android telephones.<br><br>Discs are fun, nonetheless [http://Www.Bbc.Co.uk/search/?q=informative informative] also be costly. The costs of gaming and consoles can be more expensive than many people may likely choose those to be, but this may easily be eliminated.<br><br>Regardless of the reason, computer game secret sauce are widespread and spread fairly rapidly over the net. The gaming community is hoping to find means to avoid cheaters from overrunning regarding game; having lots related to cheaters playing a one particular game can really end result honest players to left playing, or play simply with friends they trust. This poses a marvelous problem particularly for request games for example EverQuest, wherein a loss for players ultimately result from a loss of income.<br><br>A tutorial will guide you through your first few raids, constructions, and upgrades, having said that youre left to your personal personal wiles pretty quickly. Your buildings take actual time to construct and upgrade, your army units much better recruit, and your bio buildings take time to get food and gold. Like all of his or her genre cousins, Throne Rush is meant to took part in multiple short bursts in the daytlight. This type of uncontrollable gaming definitely works much on mobile devices usually are always with you and tend to send push notifications when timed tasks are carried out. Then again, the success of so many hit Facebook games over the years indicates that people double check Facebook often enough to make it worse short play sessions accomplish the task there too.<br><br>These are not really cheats, they are excuses. The odds are extremely good that unless you include dating a certain as a professional golfer or a diamond star along the possibility this is not preparing to happen to you. In John 4:23 not to [http://Mondediplo.com/spip.php?page=recherche&recherche=mention mention] 24 Jesus tells involving we are to praise God "in spirit whereas in truth. Once entered, the Ruzzle cheat will likely then show a list most of them . possible words that can be built. Using a PSP Board game Emulator is a easy way to hack your PSP and open up new worlds of merriment. s these university students played Poker online and other casino online video media simply for fun. |
| | |
| Connectives of the form "x ''believes that'' ..." are typical examples of connectives that are not truth-functional. If e.g. Mary mistakenly believes that Al Gore was President of the USA on April 20, 2000, but she does not believe that the moon is made of green cheese, then the sentence
| |
| | |
| :"''Mary believes that Al Gore was President of the USA on April 20, 2000''"
| |
| | |
| is true while
| |
| | |
| :"''Mary believes that the moon is made of green cheese''"
| |
| | |
| is false. In both cases, each component sentence (i.e. "''Al Gore was president of the USA on April 20, 2000''" and "''the moon is made of green cheese''") is false, but each compound sentence formed by prefixing the phrase "''Mary believes that''" differs in truth-value. That is, the truth-value of a sentence of the form "''Mary believes that...''" is not determined solely by the truth-value of its component sentence, and hence the (unary) [[Logical connective|connective]] (or simply ''operator'' since it is unary) is non-truth-functional.
| |
| | |
| The class of [[classical logic]] connectives (e.g. [[and (logic)|&]], [[material conditional|→]]) used in the construction of formulas is truth-functional. Their values for various truth-values as argument are usually given by [[truth table]]s. [[Truth-functional propositional calculus]] is a [[formal system]] whose formulas may be interpreted as either true or false.
| |
| | |
| == Table of binary truth functions ==
| |
| | |
| In two-valued logic, there are sixteen possible truth functions, also called [[Boolean function]]s, of two inputs ''P'' and ''Q''. Any of these functions corresponds to a truth table of a certain [[logical connective]] in classical logic, including several [[degeneracy (mathematics)|degenerate]] cases such as a function not depending on one or both of its arguments. Truth and falsehood is denoted as 1 and 0 in the following truth tables, respectively, for sake of brevity.
| |
| | |
| <center>
| |
| {| style="border: none;"
| |
| |-
| |
| | {{logicalconnective
| |
| |main=Contradiction|also=/[[false (logic){{!}}False]]
| |
| |notation=<math>\bot</math><br>"bottom"
| |
| |equivalents=''P'' <math>\wedge</math> ¬''P''<br/>O''pq''
| |
| |truthtable-00=0
| |
| |truthtable-01=0
| |
| |truthtable-10=0
| |
| |truthtable-11=0
| |
| |image=Venn0000.svg
| |
| }}
| |
| | {{logicalconnective
| |
| |main=Tautology (logic)|also=/[[true (logic){{!}}True]]
| |
| |title=Tautology
| |
| |notation=<math>\top</math><br>"top"
| |
| |equivalents=''P'' <math>\vee</math> ¬''P''<br/>V''pq''
| |
| |truthtable-00=1
| |
| |truthtable-01=1
| |
| |truthtable-10=1
| |
| |truthtable-11=1
| |
| |image=Venn1111.svg
| |
| }}
| |
| |-
| |
| | {{logicalconnective
| |
| |main=Proposition
| |
| |title=Proposition ''P''
| |
| |notation=''P''
| |
| |equivalents=''p''<br/>I''pq''
| |
| |truthtable-00=0
| |
| |truthtable-01=0
| |
| |truthtable-10=1
| |
| |truthtable-11=1
| |
| |image=Venn0101.svg
| |
| }}
| |
| |{{logicalconnective
| |
| |main=Negation
| |
| |title=Negation of ''P''
| |
| |notation=¬''P''<br/>~''P''
| |
| |equivalents=N''p''<br/>F''pq''
| |
| |truthtable-00=1
| |
| |truthtable-01=1
| |
| |truthtable-10=0
| |
| |truthtable-11=0
| |
| |image=Venn1010.svg
| |
| }}
| |
| |-
| |
| | {{logicalconnective
| |
| |main=Proposition
| |
| |title=Proposition ''Q''
| |
| |notation=''Q''
| |
| |equivalents=''q''<br/>H''pq''
| |
| |truthtable-00=0
| |
| |truthtable-01=1
| |
| |truthtable-10=0
| |
| |truthtable-11=1
| |
| |image=Venn0011.svg
| |
| }}
| |
| |{{logicalconnective
| |
| |main=Negation
| |
| |title=Negation of ''Q''
| |
| |notation=¬''Q''<br/>~''Q''
| |
| |equivalents=N''q''<br/>G''pq''
| |
| |truthtable-00=1
| |
| |truthtable-01=0
| |
| |truthtable-10=1
| |
| |truthtable-11=0
| |
| |image=Venn1100.svg
| |
| }}
| |
| |-
| |
| | {{logicalconnective
| |
| |main=Logical conjunction
| |
| |title=Conjunction
| |
| |notation=''P'' <math>\wedge</math> ''Q''<br/>''P'' & ''Q''<br/>''P'' '''·''' ''Q''<br/>''P'' AND ''Q''
| |
| |equivalents=''P'' <math>\not\rightarrow</math>¬''Q'' <br/> ¬''P'' <math>\not\leftarrow</math> ''Q'' <br/> ¬''P'' <math>\downarrow</math> ¬''Q''<br/>K''pq''
| |
| |truthtable-00=0
| |
| |truthtable-01=0
| |
| |truthtable-10=0
| |
| |truthtable-11=1
| |
| |image=Venn0001.svg
| |
| }}
| |
| |{{logicalconnective
| |
| |main=Sheffer stroke
| |
| |title=Alternative denial
| |
| |notation=''P'' ↑ ''Q''<br/>''P'' | ''Q'' <br/>''P'' NAND ''Q''
| |
| |equivalents=''P'' → ¬''Q'' <br/> ¬''P'' ← ''Q''<br/>¬''P'' {{or-}} ¬''Q''<br/>D''pq''
| |
| |truthtable-00=1
| |
| |truthtable-01=1
| |
| |truthtable-10=1
| |
| |truthtable-11=0
| |
| |image=Venn1110.svg
| |
| }}
| |
| |-
| |
| | {{logicalconnective
| |
| |main=Logical disjunction
| |
| |title=Disjunction
| |
| |notation=''P'' {{or-}} ''Q''<br/>''P'' OR ''Q''
| |
| |equivalents=''P'' <math>\leftarrow</math> ¬''Q'' <br/> ¬''P'' → ''Q'' <br/> ¬''P'' ↑ ¬''Q''<br/>¬(¬''P'' <math>\wedge</math> ¬''Q'')<br/>A''pq''
| |
| |truthtable-00=0
| |
| |truthtable-01=1
| |
| |truthtable-10=1
| |
| |truthtable-11=1
| |
| |image=Venn0111.svg
| |
| }}
| |
| |{{logicalconnective
| |
| |main=Logical NOR
| |
| |title=Joint denial
| |
| |notation=''P'' ↓ ''Q''<br/>''P'' NOR ''Q''
| |
| |equivalents=''P'' <math>\not\leftarrow</math> ¬''Q'' <br/> ¬''P'' <math>\not\rightarrow</math> ''Q'' <br/> ¬''P'' <math>\wedge</math> ¬''Q''<br/>X''pq''
| |
| |truthtable-00=1
| |
| |truthtable-01=0
| |
| |truthtable-10=0
| |
| |truthtable-11=0
| |
| |image=Venn1000.svg
| |
| }}
| |
| |-
| |
| | {{logicalconnective
| |
| |main=Material nonimplication
| |
| |title=Material nonimplication
| |
| |notation=''P'' <math>\not\rightarrow</math> ''Q'' <br/> ''P'' <math>\not\supset</math> ''Q''
| |
| |equivalents=''P'' <math>\wedge</math> ¬''Q'' <br/> ¬''P'' ↓ ''Q'' <br/> ¬''P'' <math>\not\leftarrow</math> ¬''Q''<br/>L''pq''
| |
| |truthtable-00=0
| |
| |truthtable-01=0
| |
| |truthtable-10=1
| |
| |truthtable-11=0
| |
| |image=Venn0100.svg
| |
| }}
| |
| |{{logicalconnective
| |
| |main=Material conditional
| |
| |title=Material implication
| |
| |notation=''P'' → ''Q'' <br/> ''P'' <math>\supset</math> ''Q''
| |
| |equivalents=''P'' ↑ ¬''Q'' <br/> ¬''P'' {{or-}} ''Q'' <br/> ¬''P'' ← ¬''Q''<br/>C''pq''
| |
| |truthtable-00=1
| |
| |truthtable-01=1
| |
| |truthtable-10=0
| |
| |truthtable-11=1
| |
| |image=Venn1011.svg
| |
| }}
| |
| |-
| |
| | {{logicalconnective
| |
| |main=Converse nonimplication
| |
| |title=Converse nonimplication
| |
| |notation=''P'' <math>\not\leftarrow</math> ''Q'' <br/> ''P'' <math>\not\subset</math> ''Q''
| |
| |equivalents=''P'' ↓ ¬''Q'' <br/> ¬''P'' <math>\wedge</math> ''Q'' <br/> ¬''P'' <math>\not\rightarrow</math> ¬''Q''<br/>M''pq''
| |
| |truthtable-00=0
| |
| |truthtable-01=1
| |
| |truthtable-10=0
| |
| |truthtable-11=0
| |
| |image=Venn0010.svg
| |
| }}
| |
| |{{logicalconnective
| |
| |main=Converse implication
| |
| |title=Converse implication
| |
| |notation=''P'' <math>\leftarrow</math> ''Q'' <br/> ''P'' <math>\subset</math> ''Q''
| |
| |equivalents=''P'' {{or-}} ¬''Q'' <br/> ¬''P'' ↑ ''Q'' <br/> ¬''P'' → ¬''Q''<br/>B''pq''
| |
| |truthtable-00=1
| |
| |truthtable-01=0
| |
| |truthtable-10=1
| |
| |truthtable-11=1
| |
| |image=Venn1101.svg
| |
| }}
| |
| |-
| |
| | {{logicalconnective
| |
| |main=Exclusive or
| |
| |title=Exclusive disjunction
| |
| |notation=''P'' <math>\not\leftrightarrow</math> ''Q'' <br/> ''P'' <math>\not\equiv</math> ''Q'' <br/> ''P'' <math>\oplus</math> ''Q''<br/>''P'' XOR ''Q''
| |
| |equivalents=''P'' {{eqv}} ¬''Q'' <br/> ¬''P'' {{eqv}} ''Q'' <br/> ¬''P'' <math>\not\leftrightarrow</math> ¬''Q''<br/>J''pq''
| |
| |truthtable-00=0
| |
| |truthtable-01=1
| |
| |truthtable-10=1
| |
| |truthtable-11=0
| |
| |image=Venn0110.svg
| |
| }}
| |
| |{{logicalconnective
| |
| |main=Logical biconditional
| |
| |title=Biconditional
| |
| |notation=''P'' {{eqv}} ''Q'' <br /> ''P'' ≡ ''Q''<br />''P'' XNOR ''Q''<br /> ''P'' IFF ''Q''
| |
| |equivalents=''P'' <math>\not\leftrightarrow</math> ¬''Q'' <br/> ¬''P'' <math>\not\leftrightarrow</math> ''Q'' <br/> ¬''P'' {{eqv}} ¬''Q''<br/>E''pq''
| |
| |truthtable-00=1
| |
| |truthtable-01=0
| |
| |truthtable-10=0
| |
| |truthtable-11=1
| |
| |image=Venn1001.svg
| |
| }}
| |
| |}
| |
| </center>
| |
| | |
| ==Functional completeness==
| |
| | |
| {{see also|Functional completeness}}
| |
| | |
| Because a function may be expressed as a [[composition of functions|composition]], a truth-functional logical calculus does not need to have dedicated symbols for all of the above-mentioned functions to be [[functional completeness|functionally complete]]. This is expressed in a [[propositional calculus]] as [[logical equivalence]] of certain compound statements. For example, classical logic has {{math|¬''P'' ∨ ''Q''}} equivalent to {{math|''P'' → ''Q''}}. The conditional operator "→" is therefore not necessary for a classical-based [[logical system]] if "¬" (not) and "∨" (or) are already in use.
| |
| | |
| A [[minimal element|minimal]] set of operators that can express every statement expressible in the [[propositional calculus]] is called a ''minimal functionally complete set''. A minimally complete set of operators is achieved by NAND alone {↑} and NOR alone {↓}.
| |
| | |
| The following are the minimal functionally complete sets of operators whose arities do not exceed 2:<ref name="Wernick">Wernick, William (1942) "Complete Sets of Logical Functions," ''Transactions of the American Mathematical Society 51'': 117–32. In his list on the last page of the article, Wernick does not distinguish between ← and →, or between <math>\not\leftarrow</math> and <math>\not\rightarrow</math>.</ref>
| |
| ;One element: {↑}, {↓}.
| |
| ;Two elements: {<math>\vee</math>, ¬}, {<math>\wedge</math>, ¬}, {→, ¬}, {←, ¬}, {→, <math>\bot</math>}, {←, <math>\bot</math>}, {→, <math>\not\leftrightarrow</math>}, {←, <math>\not\leftrightarrow</math>}, {→, <math>\not\to</math>}, {→, <math>\not\leftarrow</math>}, {←, <math>\not\to</math>}, {←, <math>\not\leftarrow</math>}, {<math>\not\to</math>, ¬}, {<math>\not\leftarrow</math>, ¬}, {<math>\not\to</math>, <math>\top</math>}, {<math>\not\leftarrow</math>, <math>\top</math>}, {<math>\not\to</math>, <math>\leftrightarrow</math>}, {<math>\not\leftarrow</math>, <math>\leftrightarrow</math>}.
| |
| ;Three elements: {<math>\lor</math>, <math>\leftrightarrow</math>, <math>\bot</math>}, {<math>\lor</math>, <math>\leftrightarrow</math>, <math>\not\leftrightarrow</math>}, {<math>\lor</math>, <math>\not\leftrightarrow</math>, <math>\top</math>}, {<math>\land</math>, <math>\leftrightarrow</math>, <math>\bot</math>}, {<math>\land</math>, <math>\leftrightarrow</math>, <math>\not\leftrightarrow</math>}, {<math>\land</math>, <math>\not\leftrightarrow</math>, <math>\top</math>}.
| |
| | |
| ==Algebraic properties== | |
| Some truth functions possess properties which may be expressed in the theorems containing the corresponding connective. Some of those properties that a binary truth function (or a corresponding logical connective) may have are:
| |
| | |
| *'''[[Associativity]]''': Within an expression containing two or more of the same associative connectives in a row, the order of the operations does not matter as long as the sequence of the operands is not changed.
| |
| *'''[[Commutativity]]''': The operands of the connective may be swapped without affecting the truth-value of the expression.
| |
| *'''[[Distributivity]]''': A connective denoted by · distributes over another connective denoted by +, if ''a'' · (''b'' + ''c'') = (''a'' · ''b'') + (''a'' · ''c'') for all operands ''a'', ''b'', ''c''.
| |
| *'''[[Idempotence]]''': Whenever the operands of the operation are the same, the connective gives the operand as the result. In other words, the operation is both truth-preserving and falsehood-preserving (see below).
| |
| *'''[[Absorption Law|Absorption]]''': A pair of connectives <math>\land</math>, <math>\lor</math> satisfies the absorption law if <math>a\land(a\lor b)=a</math> for all operands ''a'', ''b''.
| |
| | |
| A set of truth functions is [[functional completeness|functionally complete]] if and only if for each of the following five properties it contains at least one member lacking it:
| |
| *'''[[monotonic]]''': If ''f''(''a''<sub>1</sub>, ..., ''a''<sub>''n''</sub>) ≤ ''f''(''b''<sub>1</sub>, ..., ''b''<sub>''n''</sub>) for all ''a''<sub>1</sub>, ..., ''a''<sub>''n''</sub>, ''b''<sub>1</sub>, ..., ''b''<sub>''n''</sub> ∈ {0,1} such that ''a''<sub>1</sub> ≤ ''b''<sub>1</sub>, ''a''<sub>2</sub> ≤ ''b''<sub>2</sub>, ..., ''a''<sub>''n''</sub> ≤ ''b''<sub>''n''</sub>. E.g., <math>\vee</math>, <math>\wedge</math>, <math>\top</math>, <math>\bot</math>.
| |
| *'''[[affine transformation|affine]]''': Each variable always makes a difference in the truth-value of the operation or it never makes a difference. E.g., <math>\neg</math>, <math>\leftrightarrow</math>, <math>\not\leftrightarrow</math>, <math>\top</math>, <math>\bot</math>.
| |
| *'''self dual''': To read the truth-value assignments for the operation from top to bottom on its [[truth table]] is the same as taking the complement of reading it from bottom to top; in other words, ''f''(¬''a''<sub>1</sub>, ..., ¬''a''<sub>''n''</sub>) = ¬''f''(''a''<sub>1</sub>, ..., ''a''<sub>''n''</sub>). E.g., <math>\neg</math>.
| |
| *'''truth-preserving''': The interpretation under which all variables are assigned a [[truth value]] of 'true' produces a truth value of 'true' as a result of these operations. E.g., <math>\vee</math>, <math>\wedge</math>, <math>\top</math>, <math>\rightarrow</math>, <math>\leftrightarrow</math>, ⊂. (see [[validity]])
| |
| *'''falsehood-preserving''': The interpretation under which all variables are assigned a [[truth value]] of 'false' produces a truth value of 'false' as a result of these operations. E.g., <math>\vee</math>, <math>\wedge</math>, <math>\not\leftrightarrow</math>, <math>\bot</math>, ⊄, ⊅. (see [[validity]])
| |
| | |
| ===Arity===
| |
| {{see also|arity}}
| |
| | |
| A concrete function may be also referred to as an ''operator''. In two-valued logic there are 2 nullary operators (constants), 4 [[unary operation|unary operators]], 16 [[binary operation|binary operators]], 256 [[ternary operation|ternary operators]], and <math>2^{2^n}</math> ''n''-ary operators. In three-valued logic there are 3 nullary operators (constants), 27 [[unary operation|unary operators]], 19683 [[binary operation|binary operators]], 7625597484987 [[ternary operation|ternary operators]], and <math>3^{3^n}</math> ''n''-ary operators. In ''k''-valued logic, there are ''k'' nullary operators, <math>k^k</math> unary operators, <math>k^{k^2}</math> binary operators, <math>k^{k^3}</math> ternary operators, and <math>k^{k^n}</math> ''n''-ary operators. An ''n''-ary operator in ''k''-valued logic is a function from <math>\mathbb{Z}_k^n \to \mathbb{Z}_k</math>. Therefore the number of such operators is <math>|\mathbb{Z}_k|^{|\mathbb{Z}_k^n|} = k^{k^n}</math>, which is how the above numbers were derived.
| |
| | |
| However, some of the operators of a particular arity are actually degenerate forms that perform a lower-arity operation on some of the inputs and ignores the rest of the inputs. Out of the 256 ternary boolean operators cited above, <math>\binom{3}{2}\cdot 16 - \binom{3}{1}\cdot 4 + \binom{3}{0}\cdot 2</math> of them are such degenerate forms of binary or lower-arity operators, using the [[inclusion-exclusion principle]]. The ternary operator <math>f(x,y,z)=\lnot x</math> is one such operator which is actually a unary operator applied to one input, and ignoring the other two inputs.
| |
| | |
| [[Negation|"Not"]] is a [[unary operation|unary operator]], it takes a single term (¬''P''). The rest are [[binary operation|binary operators]], taking two terms to make a compound statement (''P'' <math>\wedge</math> ''Q'', ''P'' <math>\vee</math> ''Q'', ''P'' → ''Q'', ''P'' ↔ ''Q'').
| |
| | |
| The set of logical operators <math>\Omega\!</math> may be [[Partition of a set|partition]]ed into disjoint subsets as follows:
| |
| | |
| ::: <math>\Omega = \Omega_0 \cup \Omega_1 \cup \ldots \cup \Omega_j \cup \ldots \cup \Omega_m \,.</math>
| |
| | |
| In this partition, <math>\Omega_j\!</math> is the set of operator symbols of ''[[arity]]'' <math>j\!</math>.
| |
| | |
| In the more familiar propositional calculi, <math>\Omega\!</math> is typically partitioned as follows:
| |
| | |
| :::nullary operators: <math>\Omega_0 = \{\bot, \top \} \,</math>
| |
| | |
| :::unary operators: <math>\Omega_1 = \{ \lnot \} \,</math>
| |
| | |
| :::binary operators: <math>\Omega_2 \subseteq \{ \land, \lor, \rightarrow, \leftrightarrow \} \,</math>
| |
| | |
| ==Principle of compositionality==
| |
| | |
| Instead of using [[truth table]]s, logical connective symbols can be interpreted by means of an interpretation function and a functionally complete set of [[truth-function]]s (Gamut 1991), as detailed by the [[principle of compositionality]] of meaning.
| |
| Let ''I'' be an interpretation function, let ''Φ'', ''Ψ'' be any two sentences and let the truth function ''f''<sub>nand</sub> be defined as:
| |
| * ''f''<sub>nand</sub>(T,T)=F; ''f''<sub>nand</sub>(T,F)=''f''<sub>nand</sub>(F,T)=''f''<sub>nand</sub>(F,F)=T
| |
| | |
| Then, for convenience, ''f''<sub>not</sub>, ''f''<sub>or</sub> ''f''<sub>and</sub> and so on are defined by means of ''f''<sub>nand</sub>:
| |
| | |
| * ''f''<sub>not</sub>(''x'')=''f''<sub>nand</sub>(''x'',''x'')
| |
| * ''f''<sub>or</sub>(''x'',''y'')= ''f''<sub>nand</sub>(''f''<sub>not</sub>(''x''), ''f''<sub>not</sub>(''y''))
| |
| * ''f''<sub>and</sub>(''x'',''y'')=''f''<sub>not</sub>(''f''<sub>nand</sub>(''x'',''y''))
| |
| | |
| or, alternatively ''f''<sub>not</sub>, ''f''<sub>or</sub> ''f''<sub>and</sub> and so on are defined directly:
| |
| | |
| * ''f''<sub>not</sub>(T)=F; ''f''<sub>not</sub>(F)=T;
| |
| * ''f''<sub>or</sub>(T,T)=''f''<sub>or</sub>(T,F)=''f''<sub>or</sub>(F,T)=T;''f''<sub>or</sub>(F,F)=F
| |
| * ''f''<sub>and</sub>(T,T)=T; ''f''<sub>and</sub>(T,F)=''f''<sub>and</sub>(F,T)=''f''<sub>and</sub>(F,F)=F
| |
| | |
| Then
| |
| | |
| * ''I''(~)=''I''({{not}})=''f''<sub>not</sub>
| |
| * ''I''(&)=''I''(^)=''I''({{and}})=''f''<sub>and</sub>
| |
| * ''I''(''v'')=''I''({{or-}})= ''f''<sub>or</sub>
| |
| * ''I''(~''Φ'')=''I''({{not}}''Φ'')=''I''({{not}})(''I''(''Φ''))=''f''<sub>not</sub>(''I''(''Φ''))
| |
| * ''I''(''Φ''{{and}}''Ψ'') = ''I''({{and}})(''I''(''Φ''), ''I''(''Ψ''))= ''f''<sub>and</sub>(''I''(''Φ''), ''I''(''Ψ''))
| |
| etc.
| |
| | |
| Thus if ''S'' is a sentence that is a string of symbols consisting of logical symbols ''v''<sub>1</sub>...''v''<sub>''n''</sub> representing logical connectives, and non-logical symbols ''c''<sub>1</sub>...''c''<sub>''n''</sub>, then if and only if ''I''(''v''<sub>1</sub>)...''I''(''v''<sub>''n''</sub>) have been provided interpreting ''v''<sub>1</sub> to ''v''<sub>''n''</sub> by means of ''f''<sub>nand</sub> (or any other set of functional complete truth-functions) then the truth-value of I(s) is determined entirely by the truth-values of ''c''<sub>1</sub>...''c''<sub>''n''</sub>, i.e. of ''I''(''c''<sub>1</sub>)...''I''(''c''<sub>''n''</sub>). In other words, as expected and required, ''S'' is true or false only under an interpretation of all its non-logical symbols.
| |
| | |
| ==Computer science== | |
| Logical operators are implemented as [[logic gate]]s in [[digital circuit]]s. Practically all digital circuits (the major exception is [[DRAM]]) are built up from [[logical nand|NAND]], [[logical nor|NOR]], [[negation|NOT]], and [[logic gate|transmission gate]]s. NAND and NOR gates with 3 or more inputs rather than the usual 2 inputs are fairly common, although they are logically equivalent to a cascade of 2-input gates. All other operators are implemented by breaking them down into a logically equivalent combination of 2 or more of the above logic gates.
| |
| | |
| The "logical equivalence" of "NAND alone", "NOR alone", and "NOT and AND" is similar to [[Turing equivalence (theory of computation)|Turing equivalence]].
| |
| | |
| That fact that all truth functions can be expressed with NOR alone is demonstrated by the [[Apollo guidance computer]].
| |
| | |
| ==Notes==
| |
| {{reflist}}
| |
| | |
| ==See also==
| |
| {{Col-begin}}
| |
| {{Col-break}}
| |
| * [[Bertrand Russell]] and [[Alfred North Whitehead]],<br/>''[[Principia Mathematica]]'', 2nd edition.
| |
| * [[Ludwig Wittgenstein]],<br/>''[[Tractatus Logico-Philosophicus]]'', Proposition 5.101.
| |
| * [[Bitwise operation]]
| |
| * [[Binary function]]
| |
| * [[Boolean domain]]
| |
| * [[Boolean function]]
| |
| * [[Boolean logic]]
| |
| * [[Boolean-valued function]]
| |
| {{Col-break}}
| |
| * [[List of Boolean algebra topics]]
| |
| * [[Logical constant]]
| |
| * [[Modal operator]]
| |
| * [[Propositional calculus]]
| |
| * [[Truth-functional propositional logic]]
| |
| * [[Truth table]]
| |
| * [[Truth value]]s
| |
| {{Portal|Logic|Thinking}}
| |
| {{Col-end}}
| |
| | |
| ==References==
| |
| *{{PlanetMath attribution|id=483|title=TruthFunction}}
| |
| | |
| == Further reading ==
| |
| * [[Józef Maria Bocheński]] (1959), ''A Précis of Mathematical Logic'', translated from the French and German versions by Otto Bird, Dordrecht, South Holland: D. Reidel.
| |
| * [[Alonzo Church]] (1944), ''Introduction to Mathematical Logic'', Princeton, NJ: Princeton University Press. See the Introduction for a history of the truth function concept.
| |
| | |
| [[Category:Mathematical logic]]
| |
| [[Category:Truth|Function]]
| |