From the course: Programming Foundations: Discrete Mathematics

Unlock the full course today

Join today to access over 22,600 courses taught by industry experts or purchase this course individually.

Valid arguments

Valid arguments

From the course: Programming Foundations: Discrete Mathematics

Start my 1-month free trial

Valid arguments

“

- [Voiceover] In discrete math, it's important to understand what makes a valid argument. An argument consists of a sequence of propositions, called hypotheses. They're followed by a final proposition, called the conclusion. All propositions are either true or false. But when dealing with arguments, it's important to note that an argument is either valid or invalid. Let's take a look at determining argument validity. An argument is valid if the conclusion is true whenever all the hypotheses are true. Otherwise, it's considered invalid. An argument form contains one or more hypotheses and one conclusion, usually written in this format: proposition one, proposition two, all the way down to proposition n, and at the n we'll have three dots which represents therefore, see our conclusion. So in this case, p1, p2, to pn all have to be true at the same time the conclusion is true, then the argument is valid. Otherwise, it's invalid. Let's take a look at a sample argument. In this case, we…

Contents