tailieunhanh - Lecture Discrete mathematics and its applications - Lecture 4

This chapter define the term computer program, describe the use of flowcharts and pseudocode in programming, identify two ways in which a program can work toward a solution, differentiate the two main approaches to computer programming, list and describe three elements of object-oriented programming. | The Foundations: Logic and Proofs Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Summary Valid Arguments and Rules of Inference Proof Methods Proof Strategies Rules of Inference Section Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified Statements Revisiting the Socrates Example We have the two premises: “All men are mortal.” “Socrates is a man.” And the conclusion: “Socrates is mortal.” How do we get the conclusion from the premises? The Argument We can express the premises (above the line) and the conclusion (below the line) in predicate logic as an argument: We will see shortly that this is a valid argument. Valid Arguments We will show how to construct valid arguments in two stages; first for propositional logic and then for predicate logic. The rules of inference are the essential building block in the construction of valid arguments. Propositional Logic Inference Rules Predicate Logic Inference rules for propositional logic plus additional inference rules to handle variables and quantifiers. Arguments in Propositional Logic A argument in propositional logic is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The argument is valid if the premises imply the conclusion. An argument form is an argument that is valid no matter what propositions are substituted into its propositional variables. If the premises are p1 ,p2, ,pn and the conclusion is q then (p1 ∧ p2 ∧ ∧ pn ) → q is a tautology. Inference rules are all argument simple argument forms that will be used to construct more complex argument forms. Rules of Inference for Propositional Logic: Modus Ponens Example: Let p be “It is . | The Foundations: Logic and Proofs Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Summary Valid Arguments and Rules of Inference Proof Methods Proof Strategies Rules of Inference Section Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified Statements Revisiting the Socrates Example We have the two premises: “All men are mortal.” “Socrates is a man.” And the conclusion: “Socrates is mortal.” How do we get the conclusion from the premises? The Argument We can express the premises (above the line) and the conclusion (below the line) in predicate logic as an argument: We will see shortly that this is a valid argument. Valid Arguments We will show how to construct valid arguments in two .