Discrete Math - 1.6.2 Rules of Inference for Quantified Statements
ฝัง
- เผยแพร่เมื่อ 7 ก.ค. 2024
- Building a valid argument using rules of inference for quantified statements.
Video Chapters:
Introduction 0:00
Universal Instantiation and Universal Generalization 0:14
Existential Instantiation and Existential Generalization 2:26
Universal Modes Ponens 3:24
Constructing a Valid Argument 4:04
Practice 7:10
Practice (Proof) 11:08
Up Next 16:36
Textbook: Rosen, Discrete Mathematics and Its Applications, 7e
Playlist: • Discrete Math I (Entir...
That one student who passed the Discrete Math class without reading the book must've been De Morgan.
Haha
Literally a queen, helping students all over the world. What a wonderful person, I hope you realize how much this helps me, and how much I talk back to the screen when you aska question haha. Thank you Professor B!
Haha I love that visual! I can almost hear you answering my questions :)
I could literally cry. These videos have made so much sense to me! My teacher is not the best, so these videos have been absolute life-savers! Thank you, Professor Brehm!
Thanks i feel less stupid having this explained to me rather than reading it myself. Honestly great video.
I understood every proof question including the indirect proof, only from your channel. YOU ARE AMAZING!
This gave me some much needed practice exercises. You said many helpful things, such as keep the end in mind, and look to simplify.
Very clearly explained. Thank you!
Thank you so much, this was insanely helpful!!!
Totally clear, Thanks.
great!! you helped me a lot!!! Thank you so much
Hi, for 10:52. For the premises, there's always a check to see if x is a student in discrete math. So my question is, why isn't there a check on the conclusion statement? Can it be
∃x (d(x) ^ p(x) ^ ¬b(x))?
My exact thought, I'm stuck at this. Have you figured it out? 😅
Awesome Content
You helped me pass my retake thank you
THANK YOU SO MUCH
so helpful thank you!
hello dear teacher in the problem at 6:30 can we just say that F(X) denotes x is a dog that has 4 legs and then just use Universal instantiation or is it necessary to split F(x) into 2 parts like x has 4 legs and D(X) is a dog
The video overall was very well indeed. However, I have a question: Isn't that supposed to be ∃x (d(x) ^ p(x) ^ ¬b(x)) don't we need to specify the domain by D(x) here?? at 10:40
I don’t understand the universal generalization rule. Why is p(x) true for all values if it’s true for an random c?
At 9:15 I would like to say that the equation should look like Ǝ(x) D(x) /\ P(x) -->
eg B(x) (Left side)
(Right side) Ǝ(x)D(x) -->
eg B(x) \/(For all of (x)) D(x) --> P(x)
Then I distributed and crossed out and solved where I got
egB(x) -->
egB(x) for both sides and can substitute what I need for the sentence.
I'm not sure how you wrote the equations with and in them when the sentences showed equals to 'not reading a book' So I am curious if my way is also correct. If anyone or Kimberly knows, I'd like an answer.
Can someone help me understand why we need D(x) in the "someone who passed the class" one?
I would've thought that x was the student, what is the predicate there? I don't see anywhere in the text "a person is a discrete math student" or something. Isn't it a given?
Why didn’t the conclusion at 11:02 have a d(x)? 🤔
I'm kinda late , but it's Because they cancel each other
The only reason why the student passed the class without reading the book was because they watched your videos.
thank u 💜
I really like this. You are a great teacher. Can I get the textbook with the problems in it? What is the title?
Rosens Discrete Mathematics
Thnx very helpful series. Just curious, ever tried programming in prolog? It is a logic programming language, i am studying this series to become better at it, tho can't see why anyone would use prolog instead of one of the mainstream languages like python and c++
kimberly brehm is up on professor lenard's level
this is amazing. will there be a calc3 course?
Probably not for a while, unless I get a lot of requests.
NOBODY is on Leonard's level! But that's not to say that prof. Brehm isn't great!
You're the GOAT 🐐
you saved me
3ash sobhy
@@mohammedehab6840 hahaha 3ash sobhy & mohammed
@@youssefyoussef3652 habeeby
ya Qedme ya alm3rb (THis is literally Arabic 😅)
نتفرج عليها كويسه ولا ايع يا شباب
Why cant i just set the domain for x to students in discrete math class and then just use conjunction with my 2 premises
For the last challenge, could you not just state your domain of discourse is the class and make it much simpler? Or did you not do it so you could show the different rules and simplify the expression or show how you arrived at the conclusion?
Hi there Thank you for these lecture they are very helpful last year I stopped my Uni because I could not understand this Subject. this year I am sure I will pass it. I was wondering if you can give me the name of the text book you have mentioned in this lecture. Many thanks again for these wonderful explanation for these subject .
This text is Discrete Mathematics and It’s Applications by Rosen.
@@SawFinMath Thank you very much .
hi i have a DM exam in a few days and im stuck on a problem. is there a way i can reach you to send you the question?
I can’t make any promises, but you are welcome to email me kbrehm@bellevue.edu
Is this rules of inference in predicate logic?
I think you're looking for 1.6.1. This one would be next in line, as it uses 'For all' and 'There exists'
Actually I don’t really understand the difference between universal generalization and existential generalization. Don’t they say the same tjing
Chup mahgya amoro heigola