Posts Tagged ‘statement’
Tuesday, October 13th, 2009
How to Identify Contradictions
Description
A detailed tutorial on identifying contradictions. Step by step tutorial including several examples of how to identify contradictions for reference.
Overview
A contradiction is a statement of only false values – one that is false no matter how you look at it. In terms of mathematical logic, it is defined as a propositional form that is false for every assignment of truth values to its components. In order for a statement to be a contradiction, when the proposition is on a truth table it must be false for every possible combination of P and Q.
Tags: components, contradiction, discrete math, false, logic, Math, P, proposition, Q, statement, tautology, true, truth table
Posted in Discrete Math | No Comments »
Tuesday, October 13th, 2009
How to Identify Tautologies
Description
A detailed tutorial on identifying tautologies. Step by step tutorial including several examples of how to identify tautologies for reference.
Overview
A tautology is a statement of truth – one that is true no matter how you look at it. In terms of mathematical logic, it is defined as a propositional form that is true for every assignment of truth values to its components. In order for a statement to be a tautology, when the proposition is on a truth table it must be true for every possible combination of P and Q.
Tags: components, contradiction, discrete math, false, logic, Math, P, proposition, Q, statement, tautology, true, truth table
Posted in Discrete Math | No Comments »
Thursday, October 8th, 2009
Introduction to the Principle of Mathematical Induction
Description
A detailed tutorial of the principle of mathematical induction. Step by step tutorial including several examples of the principle of mathematical induction for reference.
Overview
The principle of mathematical induction is basically a method of proof-writing, which involves trying to prove that a certain statement is true for all natural numbers. The first statement will be proved, and then the next statement, and the next one. In this way, it is similar to a proof by exhaustion. However, since the statement must be proven for all numbers, eventually an integer will be used in the calculations. This should not be confused with mathematical induction – the principle of mathematical induction is actually a type of deductive reasoning.
Tags: deductive, discrete math, exhaustion, induction, interger, k, Math, mathematical, n!, natural, number, principle, proof, reasoning, statement
Posted in Discrete Math | No Comments »
Tuesday, October 6th, 2009
Overview of Existential and Universal Quantification
Description
A detailed tutoral on existential and universal quantification. Step by step tutorial including several examples of existential and universal quantification for reference.
Overview
Existential and universal quantifiers give us different ways to write expressions and mathematical equations. The existential quanitfier looks like a backwards capital E, and basically means “some”. The universal quantifier looks like an upside down A, and basically means “all”. For example, take the sentence “Some children don’t like clowns.” In the mathematical form of quantifiers, this would be written as (Ex) (x is a child) ^ (Ay) (y is a clown) –> (x does not like y). “Some children” indicates that you would use an existential quantifier, not a universal quantifier. Since clowns in not specific, based on context we must assume that the statement refers to all clown, and therefore we use the universal quantifier. The ^ is the symbol for “and”, implying that both of these statements are true, and the arrow is an implication stating that if there is a clown, some children will not like it based on the previous statement.
Tags: a, all, discrete math, E, existential, logic, Math, quantification, quantifiers, some, statement, universal
Posted in Discrete Math | No Comments »