Discrete Mathematics1 Theory(Syallbus)

   

UNIT- I:

Propositional Calculus: 


  1. Connectives
  2. Negation
  3.  conjunction
  4.  Disjunction
  5.  statement formulas 
  6. truth tables
  7. conditional and Bi-conditional
  8.  well formed formulas
  9. Tautologies 
  10.  Equivalence of formulas, 
  11. duality law
  12.  Tautologies implications,
  13. Functionally complete set of, other connectives, 

UNIT- II: 


 Different Type of Forms 


  1. Disjunctive normal forms,
  2.  connective normal forms, 
  3. Principal disjunctive normal form
  4. Principal conjunctive normal form. 



UNIT- III: 

Predicate Calculus: The theory of Inference for statement Calculus, validity using truth tables, Rules of inference, consistency of premises and indirect method of Proof


 UNIT- IV: 

The statement function, 
variables 
quantifier
Predicate formulas
Free and Bound variables
The universe of Discourse, 
Theory of inference for predicate calculus.


Reference Books:

 1. Discrete Mathematical Structures with applications to computer Science By J,P.Tremblay & R. Manohar, (TMH) 

2. Discrete Mathematical Structures by Kolman Busby and Ross (pearson)

 3. Discrete Mathematics By Norman Biggs. (Oxford).

 4. Logic and Discrete Mathematics : Grassmann, Tremblay (Pearson)

 5. Introduction to Automata Theory, Languages, and computation :Hopcroft, Motwani and Ullman(Pearson) 

6. An introduction to the theory of computer science , languages and machines : Sudkamp 

a7. Kenneth H Rosen Discrite Mathematics & it’s Applications TMH