CS101 Lecture 3 Part 1: Predicate Logic & Quantifiers | شرح Discrete بالعربي

CS101 Discrete Structures — Lecture 3, Part 1: Predicate Logic & Quantifiers شرح المحاضرة التالتة من Discrete بالعامية المصرية — الجزء الأول: Predicates و Quantifiers (∀ و ∃) والنفي و De Morgan والترجمة من English لـ Logic. الجزء التاني (Rules of Inference) موجود في نفس الـ playlist. Chapters 00:00 Intro — Socrates & why we need more than propositions 01:04 Where we left off (Lecture 2 recap) 01:43 Predicates & variables — P(x) 02:25 Plugging in values 03:02 More than one variable — R(x, y, z) 03:43 Quiz: Q(2, −1, 3) 04:23 Connectives still work 05:02 Quiz: proposition or not? 05:43 Quantifiers: all & some 06:30 For all ∀ 07:09 There exists ∃ 07:50 Quantifiers as loops (code) 08:29 ∀ is AND · ∃ is OR 09:12 The domain changes everything 09:51 Quiz: the domain 10:41 Precedence of quantifiers 11:25 English → Logic 12:06 Negating quantifiers 12:53 De Morgan's laws for quantifiers 13:37 Quiz: negate it 14:21 Two predicates — a bigger domain 15:14 Quiz: ∃ with ∧ vs → 16:12 Fleegles & Snurds 17:06 More Fleegles 18:00 Last quiz 18:48 Quick review Based on the CS101 Lecture 3 slides (Rosen, Discrete Mathematics, Ch. 1). #Discrete #CS101 #PredicateLogic