1 / 58

Discrete Structures Prepositional Logic 2

Discrete Structures Prepositional Logic 2. Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore. mhumayoun@ciitlahore.edu.pk https://sites.google.com/a/ciitlahore.edu.pk/dstruct/ Some of the material is taken from Dr. Muhammad Atif’s slides. Recap.

vera-bray
Download Presentation

Discrete Structures Prepositional Logic 2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Discrete StructuresPrepositional Logic 2 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore. mhumayoun@ciitlahore.edu.pk https://sites.google.com/a/ciitlahore.edu.pk/dstruct/ Some of the material is taken from Dr. Muhammad Atif’s slides

  2. Recap • Truth table:A truth table displays the relationship between the truth values of propositions. A table has rows where is number of proposition variables. • Exclusive or: is true when exactly one of and is true and is false otherwise. • Exercise: Draw a truth table of

  3. Special Definitions Inverse: Converse: Contrapositive:

  4. Example Pakistani team wins whenever it is raining p: It is raining q: Pakistani team wins q whenever pif p, then q If it is raining, then Pakistani team wins. Inverse: If it isn’t raining, then Pakistani team doesn’t win. Converse : If Pakistani team wins, then it is raining. Contrapositive: If Pakistani team doesn’t win, then it isn’t raining.

  5. Inverse Converse

  6. Biconditionals Definition 6 Let p and q be propositions. The biconditional statement p ↔ q is the proposition “p if and only if q.” The biconditional statement p ↔ q is true when p and q have the same truth values, and is false otherwise. Biconditionalstatements are also called bi-implications.

  7. Truth Table • p ↔ qhas exactly the same truth value as (p → q) ∧ (q → p)

  8. Common ways to express p ↔ q • “p is necessary and sufficient for q” • “if p then q, and conversely” • “p iffq”

  9. Example p: “You can take the flight” q: “You buy a ticket” p ↔ q: You can take the flight if and only if you buy a ticket You can take the flight iffyou buy a ticket The fact that you can take the flight is necessary and sufficient for buying a ticket

  10. p: You can take flight q: You buy a ticket You can take flight if and only if you buy a ticket What is the truth value when: • you buy a ticket and you can take the flight ?? • you don’t buy a ticket and you can’t take the flight ?? • you buy a ticket but you can’t take the flight ?? • you can’t buy a ticket but can take the flight ??

  11. Precedence of Logical Operators Can be written as (T/F) ?

  12. Exercise: For which values of a, b and c one gets 0 in the truth table of

  13. Logic and Bit Operations • Boolean values can be represented as 1 (true) and 0 (false) • A bit string is a series of Boolean values. Length of the string is the number of bits. • 10110100 is eight Boolean values in one string • We can then do operations on these Boolean strings • Each column is its ownbooleanoperation

  14. 1.2 Applications of Propositional Logic • Translating English sentences (Formalization) • System Specifications • Boolean Searches • Logic circuits • …

  15. Translating English Sentences • You can access the Internet from campus only if you are a computer science major or you are not a freshman. You can access the Internet from campus You are a computer science major you are a freshman

  16. You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old. you can ride roller coaster you are under 4 feet you are older than 16 years old

  17. System Specifications • The automated reply cannot be sent when the file system is full p: The automated reply can be sent q: The system is full

  18. Consistency • System specifications should be consistent, • They should not contain conflicting requirements that could be used to derive a contradiction • When specifications are not consistent, there would be no way to develop a system that satisfies all specifications

  19. Determine whether these system specifications are consistent: • The diagnostic message is stored in the buffer or it is retransmitted. • The diagnostic message is not stored in the buffer. • If the diagnostic message is stored in the buffer, then it is retransmitted.

  20. Determine whether these system specifications are consistent: • The diagnostic message is stored in the buffer or it is retransmitted. • The diagnostic message is not stored in the buffer. • If the diagnostic message is stored in the buffer, then it is retransmitted. p: The diagnostic message is stored in the buffer q: The diagnostic message is retransmitted 1. 2. 3.

  21. 1. 2. 3. Reasoning • An assignment of truth values that makes all three specifications true must have p false to make true. • Because we want to be true but must be false, q must be true. • Because is true when is false and is true • we conclude that these specifications are consistent • Let us do it with truth table now

  22. Is it remain consistent if the specification “The diagnostic message is not retransmitted” is added? p: The diagnostic message is stored in the buffer q: The diagnostic message is retransmitted 1. 2. 3.

  23. Is it remain consistent if the specification “The diagnostic message is not retransmitted” is added? p: The diagnostic message is stored in the buffer q: The diagnostic message is retransmitted 1. 2. 3. 4. Inconsistent

  24. Boolean Searches • Logical connectives are used extensively in searches of large collections of information, such as indexes of Web pages. • Because these searches employ techniques from propositional logic, they are called Boolean searches.

  25. Finding Web pages about universities in New Mexico: • New AND Mexico AND Universities • ‘New Mexico’ Universities • New Universities in Mexico • “New Mexico” AND Universities • (New AND Mexico OR Arizona) AND Universities • ‘New Mexico’ Universities • Arizona Universities • (Mexico AND Universities) NOTNew

  26. Quiz • Let x = “لڑک” Then x + “ا” = لڑکا Write Boolean search capturing this pattern

  27. Logic Puzzles • An island has two kinds of inhabitants, • Knights, who always tell the truth • Knaves, who always lie. • You encounter two people A and B. • What are A and B if • A says “B is a knight” • B says “The two of us are opposite types?

  28. A says “B is a knight” • B says “The two of us are opposite types? p: A is a knight : A is a knave q: B is a knight : B is a knave

  29. A says “B is a knight” • B says “The two of us are opposite types? p: A is a knight : A is a knave q: B is a knight : B is a knave First possibility: A is a knight; that is p is true.

  30. A says “B is a knight” • B says “The two of us are opposite types? p: A is a knight : A is a knave q: B is a knight : B is a knave First possibility: A is a knight; that is p is true. • If A is a knight, then he is telling the truth when he says that B is a knight, so that q is true, and A and B are the same type (both knight). • But, if B is a knight, then B’s statement that A and B are of opposite types (p ∧¬q) ∨ (¬p ∧ q), have to be true. But it is not; because A and B are both knights. Not consistent. • Conclusion: A is not a knight (p is false).

  31. A says “B is a knight” • B says “The two of us are opposite types? p: A is a knight : A is a knave q: B is a knight : B is a knave Second possibility: A is a knave; that is p is false. • If A is a knave, then he is telling lie when he says that B is a knight. So B is knave (q is false). • Also when B says that A and B are of opposite types (p ∧¬q) ∨ (¬p ∧ q), he again lies. • Conclusion: A and B are both knaves.

  32. Logic Circuits • Propositional logic can be applied to the design of computer hardware • A logic circuit (or digital circuit) receives input signals , each a bit [either 0 (off) or 1 (on)], and produces output signals , each a bit.

  33. Quiz: Draw

  34. Quiz: Draw

  35. 1.3 Propositional Equivalence • An important type of step used in a mathematical argument is the replacement of a statement with another statement with the same truth value • Propositional Equivalence is extensively used in the construction of mathematical arguments.

  36. Tautology and Contradiction • A compound proposition which is always true, is called tautology. For example, , , • A compound proposition which is always false, is called contradiction. For example, , ,

  37. Example on notebook:

  38. Logical Equivalences • Compound propositions that have the same truth values in all possible cases are called logically equivalent. • The compound propositions p and q are called logically equivalent if p ↔ q is a tautology. • The notation p ≡ q denotes that p and q are logically equivalent.

  39. Show that

  40. Standard equivalences Identity Domination

  41. Standard equivalences Idempotence Double Negation

  42. Standard Equivalences Commutative law:

  43. Standard equivalences Associativity

  44. Standard equivalences • Inversion • Negation • Contradiction

  45. Distributive Law

  46. De Morgan’s Law

  47. Generalization De Morgan’s Laws

More Related