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 reasoning and inference

Valid reasoning and inference

From the course: Programming Foundations: Discrete Mathematics

Start my 1-month free trial

Valid reasoning and inference

“

- In the study of valid reasoning, statements, also called propositions, are sentences that are either true, or false. This provides a perfect correlation with computing, as true or false answers are represented as a one or a zero, on or off. For the study of discreet math, it is important to understand that not all sentences are propositions. In other words, not all sentences, can be evaluated to true or false. Here are some sentences that are propositions. All apples are red. Today is Monday. Two plus two equals five. You might be wondering what statements are not propositions. How about, what day is it? How are you? Have a nice day. Exclamatory and questioning sentences are not usually propositions. A sentence containing a single proposition is not hard to evaluate to true or false. But when it's combined with logical operators, it can be quite a different story. Logical operators are used to make compound statements or compound propositions. To help with evaluating these more…

Contents