The image you provided shows two truth tables involving logical expressions. Let's break down the two tables and focus on how to fill them out.

Table 1:

It looks like we are working with the following expressions:

• p, q, r are propositions.
• You need to evaluate the truth values for the negations and implications.

1. For the column ~q, the truth value will be the negation of q.
2. For r → ~q, this represents an implication where r is the premise, and ~q is the conclusion. The truth value for an implication is false only if the premise is true and the conclusion is false.
3. Finally, the expression (r → ~q) ↔ p is a biconditional, meaning it is true when both sides (r → ~q and p) have the same truth value.

Table 2:

Here, we are working with the following:

• a, b, c are propositions.
• The expression involves negations (~a, ~c) and implications (b ↔ ~a, ~c → a).
• The final expression is a conjunction of two parts: (b ↔ ~a) ∧ (~c → a).

For each part, evaluate the truth values of the smaller components and fill in the table.

Would you like me to help you complete the truth tables step-by-step? Or would you like me to solve the specific parts of the expressions directly? Let me know how you would like to proceed!