TAILIEUCHUNG - Lecture Discrete mathematics and its applications (7/e) – Chapter 1 (Part I): The foundations: Logic and proofs

This chapter presents the following content: The language of propositions (connectives, truth values, truth tables), applications (translating english sentences, system specifications, logic puzzles, logic circuits), logical equivalences (important equivalences, showing equivalence, satisfiability). | The Foundations: Logic and Proofs Chapter 1, Part I: Propositional Logic With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary Propositional Logic The Language of Propositions Applications Logical Equivalences Predicate Logic The Language of Quantifiers Logical Equivalences Nested Quantifiers Proofs Rules of Inference Proof Methods Proof Strategy Propositional Logic Summary The Language of Propositions Connectives Truth Values Truth Tables Applications Translating English Sentences System Specifications Logic Puzzles Logic Circuits Logical Equivalences Important Equivalences Showing Equivalence Satisfiability Propositional Logic Section Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth Tables Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton is the capital of New Jersey. Toronto is the capital of Canada. 1 + 0 = 1 0 + 0 = 2 Examples that are not propositions. Sit down! What time is it? x + 1 = 2 x + y = z Propositional Logic Constructing Propositions Propositional Variables: p, q, r, s, The proposition that is always true is denoted by T and the proposition that is always false is denoted by F. Compound Propositions; constructed from logical connectives and other propositions Negation ¬ Conjunction ∧ Disjunction ∨ Implication → Biconditional ↔ Compound Propositions: Negation The negation of a proposition p is denoted by ¬p and has this truth table: Example: If p denotes “The earth is round.”, then ¬p denotes “It is not the case that the earth is round,” or more simply “The earth is not round.” p ¬p T F F T Conjunction The conjunction of propositions p and q is denoted by p ∧ q and has this truth table: Example: If p denotes “I am .

• Toán học
• Discrete mathematics
• Modeling computation
• Number theory
• Advanced counting techniques
• Propositional logic
• Language of propositions
• Discrete mathematics applications
• Discrete Structures
• Mathematical Reasoning
• Discrete Probability
• Lecture Discrete Mathematics I
• Discrete Mathematics I
• Bài giảng Toán rời rạc
• Probability rules
• andom variables
• Probability models
• Combinatorial Analysis
• Computer Science
• Applications discrete mathematics
• The foundations
• Basic structures
• The integers