0

I'm following a book on Discrete Mathematics, and am having trouble understanding a nuance.

Two statement forms are called logically equivalent if, and only if, they have identical truth values for each possible substitution of statements for their statement variables. The logical equivalence of statement forms P and Q is denoted by writing $P ≡ Q$.

This seems quite clear to me, as all we need to do is examine the truth tables. But the following is not so clear:

Two statements are called logically equivalent if, and only if, they have logically equivalent forms when identical component statement variables are used to replace identical component statements.

I mean, if $p$ and $q$ are two statements in isolation, where does the question of components and replacement arise? I think the term "component statement variables" are not clear to me. Can somebody explain this better and provide an example? Thanks in advance!

Amzoti
  • 56,093
ankush981
  • 2,033
  • 1
    A statement form is something like $P\to P$. A statement is something like George is bald $,\to,$ George is bald. Build something complicated using statements. The second definition says replace "George is bald" by $Q$ (everywhere) and other statements by other letters to get statement forms, and use the logical equivalence criterion for forms. – André Nicolas Jul 03 '13 at 06:24
  • Thank you. I thought statement forms were complex expressions like $\neg P \wedge (Q \vee R)$. So forms are arrived at by replacing sentences with symbols, is that right? – ankush981 Jul 03 '13 at 06:30
  • 1
    I made mine simple out of laziness. As to your second sentence, it really can't be answered, it basically asks which came first. But in defining logical equivalence of sentences, what you quoted says replace sentences with symbols, then use the definition of logical equivalence of forms. – André Nicolas Jul 03 '13 at 06:36
  • Thank you so very much for the clarification! – ankush981 Jul 03 '13 at 06:39
  • 1
    @AndréNicolas I have NEVER seen any logician define a statement form as something like P→P. A statement form is a formal object. If you define a statement form as something like P→P, then you can infer P→P→Q a statement form. A statement form seems required to qualify as unambiguous. If you keep things in linear format and don't use trees, one possible definition is "1) all lower case Latin letters are statement forms. 2) If $\alpha$ is a statement form, then ~$\alpha$ is a statement form. 3) If $\alpha$ and $\beta$ are statement forms, then ($\alpha$)→($\beta$) is statement form. – Doug Spoonwood Jul 04 '13 at 21:57
  • Would you hsvr preferred $P\land Q$? – André Nicolas Jul 04 '13 at 22:00
  • @AndréNicolas Nope. If P∧Q were a statement form, then P∧Q→R or P∧Q→R→S would qualify as a statement form. – Doug Spoonwood Jul 04 '13 at 23:08
  • Leaving outer parenthesesis a standard convention – André Nicolas Jul 04 '13 at 23:24

1 Answers1

1

Let's suppose we define a statement form (statement hereafter) as follows:

1) All lower case letters of the Latin alphabet are statements.

2) If $\alpha$ is a statement, then $\alpha$$\lnot$ is statement.

3) If $\alpha$ and $\beta$ are statements, then $\alpha$$\beta$$\land$, $\alpha$$\beta$$\lor$, $\alpha$$\beta$→, and $\alpha$$\beta$≡ (this definition has elegance when working with truth tables).

Though I don't know this text, I would guess that the author would say that all sub-statements or proper sub-statements qualify as component statements of a statement. In other words, if we have a formula $\alpha$ a "component statement" is a statement which appears within $\alpha$.

Now suppose we have a statement which is not a variable or constant, like ab≡c$\lor$a$\land$. I will hope that you find it clear that ≡ does not qualify as a component statement of ab≡c$\lor$a$\land$, nor does b≡. The component statements of ab≡c$\lor$a$\land$ are "a", b, ab≡, c, ab≡c$\lor$, and ab≡c$\lor$a$\land$ (if the statement itself gets allowed to qualify as a component of itself, the last string here listed will qualify as a component statement, if not, then the last statement does not qualify as a component statement.) Consequently, a component statement variable, I would think, comes as nothing more than a component statement which also qualifies as a variable.

When do component statement variables come as identical? When they have the same form. Thus, this passage "Two statements are called logically equivalent if, and only if, they have logically equivalent forms when identical component statement variables are used to replace identical component statements." probably implies that

ab≡c$\lor$a$\land$ is logically equivalent to xb≡c$\lor$x$\land$, as well as fb≡c$\lor$f$\land$, but NOT yb≡c$\lor$z$\land$, because "y" and "z" do not have the same form, but "a" and "a" do have the same form. That may seem trivial, but I will point out that when deriving theses (theorems of the object language) substitutions for variables has to occur uniformly. In other words, substitution has to occur for all instances of the variable in a statement.

If you were to put that example into words, you probably would say something like "the first is equivalent to the second or the third and the first." (it isn't clear in words what this means exactly because we don't have a way to associate the words representing the connectives here naturally). But, you would not say "the second is equivalent to the first or the third and the second" because by doing such you immediately have a second variable appearing before the first variable in that statement. Nor would you say "the first is equivalent to the second or the third and the second," and mean what you said with the first example of this paragraph, because if you did say "the first is equivalent to the second or the third and the second," and they were to mean the same proposition, the first would become the second and it becomes permissible to say "the second is..." which leads back to the other absurdity I spoke about in this paragraph.

The first definition implies the second, but the second does not imply the first. Consequently, he can say that the second definition comes as a special case of the first, and he hasn't contradicted himself.

If you have trouble following the definition given in the first paragraph, you might want to read this Wikipedia.

  • 1
    I think this post will be very confusing to anyone not familiar with reverse Polish notation... – tomasz Jul 04 '13 at 23:03
  • @tomasz Maybe, but everyone has to start somewhere and the definition of a statement form suffices. – Doug Spoonwood Jul 04 '13 at 23:11
  • 1
    Hmmm ... I truly appreciate the effort you've put in. While I don't understand your answer perfectly, I think it answered my question: ab≡c∨a∧ is logically equivalent to xb≡c∨x∧, as well as fb≡c∨f∧, but NOT yb≡c∨z∧, because "y" and "z" do not have the same form, but "a" and "a" do have the same form. I think the problem was that I was under the impression that a statement form is a compound statement such as $(p \to q \vee \to r)$. It makes sense now, thank you! :) – ankush981 Jul 05 '13 at 05:53