8. 1.2. Representing Statements in Predicate Logic

So let us start with the motivation of studying predicate logic, so it turns out that even though propositional logic is very interesting it cannot represent all kinds of mathematical statements that we are interested in.

Predicate logic extends the capabilities of propositional logic by allowing statements with variables that can take on different values. While propositional logic can express statements that are simply true or false, it struggles with statements that depend on varying conditions, such as the value of 'x' in the statement 'x is greater than 3.' We need predicate logic to express such statements with variables effectively.

Think of predicate logic as a more flexible toolkit designed for scenarios where the situation isn't black and white, like asking if 'any student in a class can pass'. Here, the outcome isn't yes or no until you check each student’s performance.

We want to say that x is some value which is greater than 3, we do not know whether that is true or not because that depends upon the exact value that x is going to take.

In this part, the focus is on how to describe properties of variables using predicates. Using 'greater than 3' as a property for 'x', we understand that until we define what 'x' is, we cannot determine if the statement is true or false. Predicate logic allows us to make general statements about all possible values of 'x'.

Imagine a box that can contain different toys. You might say, 'The toy in the box is a car,' but until you look inside the box, you can't confirm if it’s true. Similarly, with predicate logic, we define properties of a variable without knowing its value, just like waiting to see what's in the box.

So the way we represent these statements in the predicate logic is we introduce a function which I call as a predicate function.

Predicate functions serve as the bridge between variables and the properties they can hold. They enable us to create statements like 'P(x)', where 'P' is a predicate that describes a condition. As we assign specific values to 'x', 'P(x)' can become true or false. This allows us to construct a range of propositions from a single predicate.

Think of a predicate function like a recipe that can adapt to different ingredients. If 'P' is a recipe for making cookies, changing the ingredient from sugar to honey will give you a different outcome, just like assigning different values to 'x' changes the truth value of 'P(x)'.

It turns out that there are two methods of converting your predicates into propositions. The method number one is you assign explicitly, manually the values to your underlying variables...

We can convert predicates into propositions through manual assignment or through quantification. The first method involves inputting values directly into the predicate. However, the second, more interesting method involves quantification, which allows us to express statements that hold true for all elements in a domain or for some specific elements.

Consider a classroom where each student has a unique height. Assigning each student’s height directly to a predicate is tedious. Instead, we would prefer to say, 'All students are taller than a certain height somwhere'. This way, we're quantifying the statement rather than dealing with individual cases.

What is a universal quantification? Well whenever we want to assert that a property is true for all the elements of my domain, then I use universal quantification.

Universal quantification allows us to assert that a property or predicate applies to every element within a specific domain. The notation ( ꓯ ) signifies this concept. For example, saying 'For all integers x, P(x) is true' means every integer satisfies the predicate.

Imagine a school rule stating that 'All students must wear uniforms'. This rule applies universally to every student within the school, just as universal quantification applies to every element in a given domain.

Now let us go to the next form of quantification which we call as existential quantification and this quantification asserts that a property is true for at least one element of my domain.

Existential quantification is used when we want to declare that there is at least one element in our domain for which a predicate holds true. The notation ( ꓱ ) represents this concept, meaning 'there exists an x such that P(x) is true'.

Think of a library where you say, 'There exists a book that is authored by a famous writer'. This statement is satisfied as long as at least one book fits this description, similar to how existential quantification asserts the existence of at least one true case.

Now let us define what we call as bounded and free variables.

In predicate logic, a variable is termed 'bound' if it falls under the scope of a quantifier, meaning its value is restricted by the quantifier's expression. Conversely, if a variable has no quantifiers applied to it, it's considered a 'free variable'. Understanding this distinction is crucial to maintaining clarity in logical statements.

Imagine a group task where the leader delegates roles to each member. Each member's role is 'bound' to the group task, while ideas proposed by individuals not assigned a role are 'free' and can be taken up at any time. Similarly, variables that are not quantified retain their independence.

So now we can define logical equivalences even for the predicate world, we can define predicates, we can have quantified statements and we can have two different expressions...

Logical equivalences in predicate logic resemble those in propositional logic but consider the context of predicates and domains. Two expressions are considered logically equivalent if they consistently yield the same truth value across all possible domains. This property allows us to interchange logically equivalent statements without changing their overall truth.

Consider two friends making plans to meet. If one says, 'If it rains, then we will meet at the café,' and the other says, 'We won't meet if it doesn't rain,' they express the same idea in different ways. Understanding these logical equivalences helps clarify concepts in more complex scenarios.

--