Art of Problem Solving

Logic: Difference between revisions

Thkim1011 (talk | contribs)
Djmathman (talk | contribs)
No edit summary
Line 9: Line 9:
A '''Logical notation''' is a special syntax that is shorthand for logical statements.  
A '''Logical notation''' is a special syntax that is shorthand for logical statements.  


==Negations==
===Negations===
A negation is denoted by <math>\neg p</math>. <math>\neg p</math> is the statement that is true when <math>p</math> is false and the statement that is false when <math>p</math> is true. This means simply "the opposite of <math>p</math>"
A negation is denoted by <math>\neg p</math>. <math>\neg p</math> is the statement that is true when <math>p</math> is false and the statement that is false when <math>p</math> is true. This means simply "the opposite of <math>p</math>"


==Conjunction==
===Conjunction===
The conjunction of two statements basically means "<math>p</math> and <math>q</math>" and is denoted by <math>p \land q</math>.
The conjunction of two statements basically means "<math>p</math> and <math>q</math>" and is denoted by <math>p \land q</math>.


==Disjunction==
===Disjunction===
The disjunction of two statements basically means "<math>p</math> or <math>q</math>" and is denoted by <math>p \land q</math>.
The disjunction of two statements basically means "<math>p</math> or <math>q</math>" and is denoted by <math>p \land q</math>.


==Implication==
===Implication===
This operation is given by the statement "If <math>p</math>, then <math>q</math>". It is denoted by <math>p\Leftrightarrow q</math>. An example is "if  <math>x+3=5</math>, then <math>x=2</math>.
This operation is given by the statement "If <math>p</math>, then <math>q</math>". It is denoted by <math>p\Leftrightarrow q</math>. An example is "if  <math>x+3=5</math>, then <math>x=2</math>.


==Converse==
===Converse===
The converse of the statement <math>p \Leftrightarrow q</math> is <math>q \Leftrightarrow p</math>.
The converse of the statement <math>p \Leftrightarrow q</math> is <math>q \Leftrightarrow p</math>.


==Contrapositive==
===Contrapositive===
The contrapositive of the statement <math>p \Leftrightarrow q</math> is <math>\neg p \Leftrightarrow \neg q</math>
The contrapositive of the statement <math>p \Leftrightarrow q</math> is <math>\neg p \Leftrightarrow \neg q</math>



Revision as of 17:23, 22 November 2011

Logic is the systematic use of symbolic and mathematical techniques to determine the forms of valid deductive or inductive argument.

Statements

A statement is either true or false, but it will never be both or neither. An example of statement can be "A duck is a bird." which is true. Another example is "A pencil does not exist" which is false.

Logical Notations

Main article: Logical notation

A Logical notation is a special syntax that is shorthand for logical statements.

Negations

A negation is denoted by $\neg p$. $\neg p$ is the statement that is true when $p$ is false and the statement that is false when $p$ is true. This means simply "the opposite of $p$"

Conjunction

The conjunction of two statements basically means "$p$ and $q$" and is denoted by $p \land q$.

Disjunction

The disjunction of two statements basically means "$p$ or $q$" and is denoted by $p \land q$.

Implication

This operation is given by the statement "If $p$, then $q$". It is denoted by $p\Leftrightarrow q$. An example is "if $x+3=5$, then $x=2$.

Converse

The converse of the statement $p \Leftrightarrow q$ is $q \Leftrightarrow p$.

Contrapositive

The contrapositive of the statement $p \Leftrightarrow q$ is $\neg p \Leftrightarrow \neg q$

Truth Tables

A truth tale is the list of all possible values of a compound statement.

Quantifiers

There are two types of quantifiers: A universal Quantifier: "for all" and an existential Quantifier: "there exists". A universal quantifier is denoted by $\forall$ and an existential quantifier is denoted by $\exists$.

See Also