Mat 210 Groupreport
Mat 210 Groupreport
GROUP MEMBERS:
DATE OF COMPLETION:
TABLE OF CONTENT
1
1.0 INTRODUCTION
The fundamentals of logic form the foundation for structured reasoning and critical
thinking in mathematics or computer science. Logic is the study of principles and methods used to
evaluate the validity and truth of statements or arguments. It provides a systematic framework for
analysing propositions, relationships between them, and the rules governing their manipulation.
Logic involves propositions, which are statements that can be classified as either true or
false. Fundamental logical operations include conjunction, disjunction, negation and implication.
These operations, combined with truth tables, help define the truth values of complex statements
based on simpler ones. Logic also introduces concepts such as logical equivalence, where two
expressions yield the same truth values under all conditions, and validity, which ensures that a
conclusion logically follows from given premises.
The study of logic is essential for developing formal systems of reasoning, constructing
sound arguments, and solving problems systematically. It underpins advanced topics like predicate
logic, proof theory, and computational logic, all of which are indispensable for disciplines
requiring precision and clarity.
2
2.0 DESCRIPTION
The concepts of logic are the foundational elements that enable systematic reasoning and
analysis of statements and arguments. These concepts include propositions, logical operations,
truth tables, equivalence and validity, each playing a critical role in understanding and applying
logical principles.
Logical Operations
Rules of Inference
Rules of inference are logical principles that guide the derivation of conclusions from
premises. They serve as the foundation for constructing valid arguments and proofs in logic.
Each rule represents a valid pattern of reasoning that ensures the conclusion is true if the
premises are true.
3
4
3.0 EXAMPLES
Solution:
Primitive propositions
Premise
• P∧Q
• P→(¬Q∨¬R)
• S→R
5
1. Find the conclusion for the sequence of propositions above using rules of inference.
1. P∧Q (Premise 1)
2. P→(¬Q∨¬R) (Premise 2)
3. S→R (Premise 3)
4. P (Premise 1, Simplification)
5. ¬Q∨¬R (Premise 2 & 4, Modus ponens)
6. Q (Premise 1, Simplification)
7. ¬R (5 & 6, Disjunctive syllogism)
8. ¬S (Premise 3 & 7 Modus tollens)
P Q R S P∧Q
T T T T T
T T T F T
T T F T T
T T F F T
T F T T F
T F T F F
T F F T F
T F F F F
F T T T F
F T T F F
F T F T F
F T F F F
F F T T F
F F T F F
F F F T F
F F F F F
6
¬Q ¬R ¬Q∨¬R P→(¬Q∨¬R) S→R ¬S
F F F F T F
F F F F T T
F T T T F F
F T T T T T
T F T T T F
T F T T T T
T T T T F F
T T T T T T
F F F T T F
F F F T T T
F T T T F F
F T T T T T
T F T T T F
T F T T T T
T T T T F F
T T T T T T
The last column only contains T’s. Therefore, (P∧Q) ∧ (P→(¬Q∨¬R)) ∧(S→R)
logically implies ¬S.
∴ Valid
7
3. Find the truth value for each primitive propositions.
Proposition: P→(¬Q∨¬R)
8
4.0 CONCLUSION
The chapter on the fundamentals of logic in discrete mathematics introduces the core concepts
of propositional and predicate logic, essential for mathematical reasoning and computational
theory. It covers logical connectives, truth tables and formal proof techniques, emphasizing
their importance in constructing valid arguments and solving problems. In this project, we
successfully applied principles of logic to solve real-world scenarios, demonstrating the
validity of arguments through deductive reasoning and truth tables. This project not only
deepened our understanding of theoretical concepts but also emphasized their practical
applications, showcasing how logic serves as a cornerstone for technological and analytical
advancements.
5.0 REFERENCE
Neso Academy. (2018, May 20). Propositional Logic – Logical Equivalences [Video].
YouTube. https://www.youtube.com/watch?v=tDH67yRNXzI