Statements can be proven to be either true, false, or neither.

A statement that is either true or false but not

both is called a proposition. Propositional logic deals with statements, and these propositions can be combined into
compound propositions. In constructing compound proposition there are rules to follow. First let us define propostion
by lowercase letters p, q, r. The conjunction of p and q, denoted as p ⋀ q . It can be read as p and q. The compound
proposition being true if both simple propositions are true, and false if otherwise. The disjuction of p and q, denoted
as p ⋁ q . It can be read as p or q. The disjunction being true if atleast one of the simple propostions are true, and
false if otherwise. The negation of p, denoted as ¬ p . It can be read as “not p,” or “it is not true that p.” The
conditional of p and q which is written as “if p then q,’ and denoted as p →q . A conditional proposition is false only
when p is true and q is false. In other words, truth cannot imply a false statement, but a false statement can imply a
true statement. For example, if x=−2 , then x 2=4.which can be proven as true even though it doesn’t satisfy the
condition, say when x=2. The biconditional of p and q is denoted as p ↔q . The biconditional proposition can be
true if and only if both conditionals are true.

Truth tables are two valued logics used by mathematicians. Every statements is either True or False. This
is called the Law of the Excluded Middle. A truth table shows how the truth or falsity of a compound proposition
depends on the truth or flasity of the simple propositions. A simple example is:

p ¬p
T F
F T

If p is true, then its negation is false. If p is false, then the negation of that proposition is true. Another
example is the conjunction of p and q.

p q p⋀q
T T T
T F F
F T F
F F F

These compound propositions can be added with even more simple and/or compound propositions, and by
using truth tables, their truth and falsity can be determined. An example of this is ¬( p ⋀ q) →( p ↔q )

p q p⋀q ¬( p ⋀ q) ( p ↔ q) ¬( p ⋀ q) →( p ↔q )
T T T F T T
T F F T F F
F T F T F F
 F F F T T T
In validating and proving there are 2 sets of rules. The first being the the rules of inference, and the second
being the rules of replacement. Listed below are the rules of inference:

1. Modus Ponens
a. p →q
b. ∴ p ; ∴ q
2. Modus Tollens
a. p →q
b. ∴ ¬ p ; ∴¬ q
3. Hypothetical Syllogism
a. p →q
b. q → r
c. ∴ p → r
4. Disjunctive Syllogism
a. p⋁q
b. ∴ ¬ p
c. ∴ q
5. Constructive Dilemma
a. ( p → q) ⋀(r → s)
b. ∴ p ⋁ r
c. ∴ q ⋁ s
6. Destructive Dilemma
a. ( p → q) ⋀(r → s)
b. ∴ ¬ p ⋁ ¬ r
c. ∴ ¬q ⋁ ¬ s
7. Simplification
a. p⋁q
b. ∴ p
8. Conjunction
a. p
b. q
c. p⋀q
Next, listed below are the rules of replacement:

1. De Morgan’s Laws
a. ¬( p ⋀ q) ≡¬ p ⋁ ¬ q
b. ¬( p ⋁ q) ≡¬ p ⋀ ¬ q
2. Commutation
a. p ⋀ q ≡q ⋀ p
3. Association
a. p ⋀ (q ⋀ r)≡( p ⋀ q) ⋀ r
b. p ⋁ (q ⋁ r)≡( p ⋁ q) ⋁ r
4. Distribution
a. p ⋀ (q ⋁ r)≡( p ⋀ q)⋁ ( p ⋀ r )
b. p ⋁ (q ⋀ r)≡( p ⋁ q)⋀ ( p ⋁ r )
5. Double Negation
a. ¬(¬ p)≡ p
6. Law of Contrapositive
a. p →q ≡ ¬q → ¬ p
7. Material Equivalence
a. p ↔q ≡( p → q)⋀(q → p)
8. Exportation
a. ( p ⋀ q)→ r ≡ p→( q → r)

An example of a validitation table is:

Statement Proof
( p ⋁ q)→ ¬¬ s Premise
q⋁ p Premise
s →[ r ⋁ ( q ⋁ w )] Premise
∴ w ⋁ (r ⋁ q) Prove
p⋁q Commutation (2)
¬¬ s Modus Ponens (1)(5)
s Double Negation (6)
r ⋁ (q ⋁ w) Modus Ponens (3)(7)
(r ⋁ q) ⋁ w Association (8)
w ⋁( r ⋁ q) Commutation (9)
References:

Biconditional Statement. (n.d.). Retrieved August 07, 2020, from

 https://www.varsitytutors.com/hotmath/hotmath_help/topics/biconditional-statement

Truth Tables, Tautologies, and Logical Equivalences. (n.d.). Retrieved August 07, 2020, from

http://sites.millersville.edu/bikenaga/math-proof/truth-tables/truth-tables.html

Libretexts. (2020, July 27). 2.6 Arguments and Rules of Inference. Retrieved August 07, 2020, from

https://math.libretexts.org/Courses/Monroe_Community_College/MTH_220_Discrete_Math/2:_Logic/2.6_Ar
guments_and_Rules_of_Inference

How To Use Truth Tables to Analyze Arguments. (n.d.). Retrieved August 07, 2020, from

https://www.math.fsu.edu/~wooland/argumentor/TruthTablesandArgs.html