Dis - Struc - Itec 205 - l1
Dis - Struc - Itec 205 - l1
Dis - Struc - Itec 205 - l1
STUDIES
PREPARED BY: P. FERNANDEZ
Discrete Structures
LESSON 1
Discrete Structure
Asetof discrete elements on which certain
operations are defined. Discrete implies
noncontinuous and therefore discrete sets
includefiniteandcountable setsbut not
uncountable sets such as the real numbers.
The term discrete structure covers many of the
concepts of modern algebra, including integer
arithmetic,monoids,semigroups, groups,
graphs,lattices,semirings,rings,fields,
andsubsetsof these
regarding
Sets, Relations
and Functions
Mathematical Logic
Group theory
Counting Theory
Probability
Mathematical Induction and Recurrence
Relations
Graph Theory
Trees
Boolean Algebra
Propositional Logic
The rules of mathematical logic specify methods of
reasoning mathematical statements. Greek
philosopher, Aristotle, was the pioneer of logical
reasoning.
Logical reasoning provides the theoretical base for
many areas of mathematics and consequently
computer science.
It has many practical applications in computer
science like design of computing machines,
artificial intelligence, definition of data structures
for programming languages etc.
Propositional Logic
Propositional Logic- is concerned with statements
to which the truth values, true and false, can be
assigned. The purpose is to analyze these statements
either individually or in a composite manner.
Connectives
In propositional logic generally we
use five connectives which are OR
(), AND (), Negation/ NOT (),
Implication / if-then (), If and only if
().
Connectives
OR () The OR operation of two propositions A and B
(written as A B) is true if at least any of the propositional
variable
A or
B is true.
The truth
table
is as follows
A
AB
True
True
True
True
False
True
False
True
True
False
False
False
Connectives
AND () The AND operation of two propositions A and B
(written as A B) is true if both the propositional variable A
and
is true.
The Btruth
table is as follows
A
AB
True
True
True
True
False
False
False
True
False
False
False
False
Connectives
Negation () The negation of a proposition A (written as
A) is false when A is true and is true when A is false.
The truth table is as follows
A
True
False
False
True
Connectives
Implication / if-then () An implication AB is False if A
is true and B is false. The rest cases are true.
The truth table is as follows
A
AB
True
True
True
True
False
False
False
True
True
False
False
True
Connectives
If and only if () AB is bi-conditional logical connective
which is true when p and q are both false or both are true.
The truth table is as follows
A
AB
True
True
True
True
False
False
False
True
False
False
False
True