Posts Tagged ‘logic’
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 »
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 »
Thursday, September 24th, 2009
The Modus Tollens Rule Explained
Description
A detailed tutorial on the modus tollens rule. Step by step tutorial including several example problems of the modus tollens rule for reference.
Overview
Modus tollendo tollens, often simply referred to as modus tollens, is an argument in logic that states if P, then Q. Negation of Q, therefore negation of P. This is sometimes called denying the consequent, and is often confused with the indirect proof of proving by contraposition. There are several forms that the modus tollens rule can take, depending on when and how you are using it.
Logical Operator Notation: 
Basic Form: 
With Assumptions: 
Set Theory:



Predicate Logic:



Tags: assumptions, discrete math, logic, logical operator, Math, modus tollendo tollens, modus tollens, negation, P, predicate, proofs, Q, rule, sequent, set theory, then, therefore, truth tables
Posted in Discrete Math | No Comments »
Thursday, September 24th, 2009
The Modus Ponens Rule Explained
Description
A detailed tutorial on the modus ponens rule. Step by step tutorial including several examples of the modus ponens rule for reference.
Overview
Modus ponendo ponens, typically shortened to just modus ponens, is an argument in logic. It is closely related to the argument modus tollens. Modus ponens states that if P, then Q. P, therefore Q. This can be expressed in either sequent form or rule form for formal notation.
Sequent Form: 
Rule Form: 
Tags: discrete math, logic, Math, modus ponendo ponens, modus ponens, P, proofs, Q, rule, sequent, then, therefore, truth tables
Posted in Discrete Math | No Comments »