A science-fair rule says a project can enter if it has a poster and a working demo. As a condition that is hasPoster AND hasDemo. Each piece is a test that is true or false on its own, and AND joins them into one answer that is true only when both pieces are. A project with a poster but a broken demo gives true AND false, which is false. Change the rule to OR and the same project gets in, because one true piece is enough. NOT flips a single test: NOT late is true for every project handed in on time.
Numbers show how much one word matters. Take x > 0 AND x < 10. For x = 7 both parts are true, so the condition is true. For x = 12 the first part is true and the second is false, so AND gives false. Swap in OR and x = 12 passes, and so does every other number, because any number is either greater than 0 or less than 10. One word turned a range check into a condition that is always true.
When operators are mixed, NOT is applied first, then AND, then OR, so a OR b AND c means a OR (b AND c); add parentheses when you mean something else. Also watch for a condition that looks like two tests but is not: x == 5 OR 10 reads like English, yet the right side is just the number 10, which many languages treat as true. Each side of an operator must be a complete true/false test: x == 5 OR x == 10.
Think of it like this. Two light switches wired one after the other light the bulb only when both are on: that is AND. Wired side by side, either switch alone lights it: that is OR. NOT is a switch mounted upside down. The picture predicts every two-input case, but it says nothing about the order a program follows in a long mix of operators.
Core idea. Logical operators let you build complex conditions from simple boolean tests.