UNIVERSITI TEKNOLOGI MARA

85000 SEGAMAT, JOHOR

FACULTY OF COMPUTER AND MATHEMATICAL SCIENCES

Fakulti Sains Komputer dan Matematik

DISCRETE MATHEMATICS

(MAT210)

GROUP REPORT
Title:

FUNDAMENTAL OF LOGICS

LECTURER NAME

MUHAMMAD YASSAR BIN YUSRI

GROUP MEMBERS
GROUP NAME STUDENT ID
JCS1103C MUHAMMAD HUSNI BIN MOHD HARDI 2020475167

JCS1103C MUHAMMAD AZRUL BIN AMIR 2020870776

SUBMISSION DATE: 29/1/2023

 TABLE OF CONTENTS
1. Introduction 3
2. Arguments 4
3. Truth Table 5
Logical Connectivity 5
4. Logical Equivalence 6
5. Law Of Logics 7
6. Rules Of Inference 8
7. Applications of Fundamentals of Logic 9
Career Planning 9
Maintaining Relationship 9
8. Conclusion 10
9. Reference 11
1. Introduction
Discrete mathematics is the study of mathematical structures that are
"discrete" in the sense that they have a bijection with the set of natural
numbers rather than continuous in the sense that continuous functions are.
Integers, graphs, and logic statements are examples of discrete mathematics
objects.

The area of mathematics known as discrete mathematics is focused on the

study of discrete objects as opposed to continuous ones.

Examples of discrete objects:

integers, distinct paths to travel from point A to point B on a map along a road
network, ways to pick a winning set of numbers in the lottery.
All following computer science courses require a solid mathematical
foundation, which discrete mathematics courses give
2. Arguments
Arguments are an essential component of logical reasoning and
philosophy. It is also essential in mathematical proofs. In this essay, we shall
shed some light on logical reasoning arguments. Mathematical logic can be
used to prove logical proofs. A valid argument that determines the truth values
of mathematical propositions is referred to as a proof. The argument is a
collection of statements or propositions that include premises and
conclusions. The final or final statement is referred to as a conclusion, and the
remaining statements are referred to as premises.

A logical connectives is a symbol which is used to connect two or more

propositional or predicate logics in such manner that resultant logic
dependents only on the input and the meaning of the connective used
For example :-
3. Truth Table
In mathematics, a truth table is used to conduct logical operations. These
operations are referred to as boolean algebra or boolean functions. It is
mostly used to determine if a prepositional phrase is true or false based on
the input values. This relies on boolean algebra. It is made of columns for one
or more input values, such as P and Q, and one column for the output results.

Logical Connectivity
A logical connective also known as a logical operator, sentential
connective, or sentential operator is a logical constant in logic. They are
useful for connecting logical formulations.
Negation, disjunction, conjunction, and implication are examples of
common connectives. These connectives are read as truth functions in normal
systems of classical logic, but they have a number of alternative meanings in
nonclassical logics.
4. Logical Equivalence
In propositional logic or Boolean algebra, logical equivalence is the
condition of equality that exists between two statements or phrases. The link
between the two assertions is orally expressed as "if and only if." In
mathematics, logical equivalence is usually represented by a double arrow
(or) or three lines (). The double arrow is also known as an IIF function.
Logical equivalence occurs when two statements have the same truth value.
For example, if P<- ->Q, the column containing P and Q will have
identical truth values.
 5. Law Of Logics
Assume there are two compound statements, X and Y, which are logically
equivalent if and only if their truth tables have the identical truth values in their
columns. The logical equivalence can be represented with the sign = or. As a result,
the logical equivalence of these assertions will be X = Y or X Y.

We have established, using the logical equivalence concept, that if the

compound propositions X and Y are logical equivalence, then the X Y must be
Tautology.

To describe the law of logical equivalence, we shall use the 'AND' and 'OR'
symbols in this legislation. AND is represented by the symbol here, while OR is
represented by the symbol. There are several laws of logical equivalence, which are
as follows:
6. Rules Of Inference
For logical proofs, mathematical logic is frequently used. Valid
arguments that determine the truth values of mathematical statements are
known as proofs.
An argument is a collection of statements. The last assertion is the
conclusion, while the statements before it are referred to as premises (or
hypothesis). Before the conclusion, the symbol " " (read hence) is put.
The conclusion of a sound argument flows from the truth values of the
premises.
 7. Applications of Fundamentals of Logic

Career Planning
In the same vein, we never make life decisions without carefully
considering them. Similar to this, choosing a future career or sector requires serious
thought, not just because you are passionate about it, which is subjective, but also
because you have the essential abilities and expertise to accomplish it or have the
potential to do it. Here, rationality acts as a check on all of our assumptions and
illusions that we have made up for ourselves

Maintaining Relationship
Individuals can maintain relationships by employing rationality. A
reasonable partner is beneficial in maintaining relationship harmony. Their
analysis contributes to the collection of data, observations, and "truths" from
the outside world to support their partner's interpretation of the problem. They
keep trying to cheer up their partner and mean well. helping them along the
route and assisting them in comprehending the positive and poor parts of the
outlook.
8. Conclusion
The application of logic in actual life teaches us that every living thing
or work we undertake has a calculation. In this issue, logic can also be used
to assess the arguments of others. When a person understands how to read
arguments and how they should and should not be built. They will find all
kinds of flawed arguments that can undermine their opponent's conclusion.
Both the truth table conclusion and the rules of inference are correct. The
arguments we use are sound.
9. Reference
1. Arguments in discrete mathematics (2023) GeeksforGeeks. GeeksforGeeks.
Available at:
https://www.geeksforgeeks.org/arguments-in-discrete-mathematics/ (Accessed:
January 29, 2023).

2. Law of logical equivalence in discrete mathematics - javatpoint (no date)

www.javatpoint.com. Available at:
https://www.javatpoint.com/law-of-logical-equivalence-in-discrete-mathematics#
:~:text=Suppose%20there%20are%20two%20compound,can%20represent%2
0the%20logical%20equivalence. (Accessed: January 29, 2023).

3. Libretexts (2021) 3.4: The laws of logic, Mathematics LibreTexts. Libretexts.

Available at:
https://math.libretexts.org/Bookshelves/Combinatorics_and_Discrete_Mathema
tics/Applied_Discrete_Structures_(Doerr_and_Levasseur)/03%3A_Logic/3.04%
3A_The_Laws_of_Logic (Accessed: January 29, 2023).