Join Peggy Fisher for an in-depth discussion in this video Rules of inference, part of Programming Foundations: Discrete Mathematics.
- [Voiceover] When evaluating arguments for validity,…there are several rules of inference that can…make the process much easier.…The idea is to take the original argument…and label each predicate with a unique variable.…Then rewrite the problem using the variables,…the logical connectors, and conditional statements…such as and, or, if then, not, et cetera.…Here's an example.…In this argument it says if it rains, Cy will be sick.…
Cy is not sick, therefore it did not rain.…Okay, let's label each predicate.…If it rains can be P.…Cy will be sick is going to be Q.…Cy is not sick will be not Q.…Therefore, it did not rain, not P.…Now I can say P then Q…for the first sentence.…That means if it rains, Cy will be sick.…The next premises or hypothesis is not Q,…meaning that Cy is not sick.…
Therefore, not P.…Now we can look at the rules of inference…to find a match to our format.…If we find a match, we know this is a valid argument.…Let's review the rules of inference.…The first one is modus ponens.…Modus ponens says if P then Q,…
This course relies on an open-source SML (standard machine language) library to demo the concepts behind discrete math. Peggy Fisher shows you how to manipulate sets of data, write proofs and truth tables, analyze data sequences, and visualize data using graph theory. Challenges at the end of every chapter allow you to test your knowledge. By the end of the course, you should be able to make the leap from theory to using discrete math in practice: saving time and resulting in code that's cleaner and easier to maintain in the long run.
- Real-world discrete math
- Objects as sets
- Set notation and operations
- Standard machine language (SML) setup
- Working with data types, strings, and functions in SML
- Analyzing data sequences
- Writing truth tables
- Identifying and evaluating predicates
- Validating arguments
- Writing proofs: subset, conditional, and biconditional proofs
- Visualizing data with graphs
- Advanced discrete math techniques
Skill Level Intermediate
Programming Foundations: Design Patterns (2013)with Elisabeth Robson2h 19m Intermediate
1. Discrete Math Uses
3. Setting Up SML
4. Analyzing Data Sequences
5. Effective Arguments and Defensible Decisions
6. Proofs Made Easy
7. Advanced Discrete Math Topics
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.Cancel
Take notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.