MHB Logical Implication: Evaluating Truth of Claims

  • Thread starter Thread starter Yankel
  • Start date Start date
  • Tags Tags
    implication
Yankel
Messages
390
Reaction score
0
Hello all,

I am trying to find if the following two claims are true or false:

1) If
\[\alpha \models \left ( \beta \rightarrow \gamma \right )\]
then
\[\alpha ,\beta \models \gamma\]

2) If
\[\alpha \models \left ( \beta \rightarrow \gamma \right )\]
then
\[\alpha \vee \beta \models \gamma\]

where \[\models\] is logical implication, meaning that if everything on the left side of the operator is T, then whatever on the right side is also T.

I cannot build truth tables, because \[\alpha ,\beta ,\gamma\] are not necessarily atoms.

Thank you in advance.
 
Physics news on Phys.org
Yankel said:
1) If
\[\alpha \models \left ( \beta \rightarrow \gamma \right )\]
then
\[\alpha ,\beta \models \gamma\]
This holds by definition of $\models$ and $\to$. Suppose $\alpha\models \beta\to\gamma$. This means that for every interpretation $I$, if $I\models\alpha$, then $I\models\beta\to\gamma$. But the latter statement means that if $I\models\beta$, then $I\models\gamma$. Thus, if $I\models\alpha$ and $I\models\beta$, then $I\models\gamma$, or $\alpha,\beta\models\gamma$.

In general, $\alpha\models\beta$ iff $\models\alpha\to\beta$ (i.e., $\alpha\to\beta$ is true in every interpretation). In this sense, the connective $\to$ formalizes (i.e., is an analog on the level of the formal language being studied) the concept of logical implication $\models$. Also, $\alpha\land\beta\to\gamma$ is equivalent to $\alpha\to(\beta\to\gamma)$, i.e., these formulas are true in the same interpretations.

Yankel said:
2) If
\[\alpha \models \left ( \beta \rightarrow \gamma \right )\]
then
\[\alpha \vee \beta \models \gamma\]
According to the above, $\alpha\models\beta\to\gamma$ is equivalent to $\alpha\land\beta\models\gamma$. Can you decide if this implies $\alpha\lor\beta\models\gamma$ and vice versa?
 
I am not sure. Is there a way to see it using a truth table?
 
Consider when $\gamma$ is $\alpha\land\beta$.
 
I see what you mean, so it ain't true, is it ? I need both \alpha and \beta to be true, while \lor requires that at least one is true, not necessarily both.
 
Last edited:
Yankel said:
I see what you mean, so it ain't true, is it ? I need both \alpha and \beta to be true, while \lor requires that at least one is true, not necessarily both.
You are right, $$\alpha\lor\beta\not\models\alpha\land\beta$$ in general, in particular, when $\alpha$ and $\beta$ are propositional variables. If $\alpha$ and $\beta$ are formulas, this implication may sometimes be true, for example, when $\alpha$ and $\beta$ are tautologies.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top