Symbolic Logic explores the principles of formal reasoning and the use of symbols to represent logical expressions.
Predicate logic lets us talk about properties of objects and relationships between them, not just whole statements.
A predicate says something about an object. For example, \( P(x) \) could mean "x is a dog". You can apply it to different objects: \( P(Fido) \), \( P(Bella) \), etc.
Quantifiers make it possible to express things like "Everyone loves pizza" (\( \forall x, L(x, \text{pizza}) \)) or "Someone is sad" (\( \exists x, S(x) \)).
Predicate logic allows for much more detailed and flexible reasoning, especially in mathematics and computer science.
\[\forall x, P(x) \rightarrow Q(x)\]
Using \( \forall x, (C(x) \rightarrow M(x)) \) to say 'All cats are mammals'.
Expressing 'Some students are happy' as \( \exists x, (S(x) \land H(x)) \).
Predicate logic uses quantifiers and predicates to express complex ideas about objects and their properties.