3

When we talk about formal logic, we generally agree that $P$ and $Q$ are deductively valid propositions.

Below fact is supported by Ref. Rutger Uni. page no.2 (PDF doc)

And further when we talk about implication or material/concrete conditional $P\to Q$ we assume: "if $P$ is true, then $Q$ is also true" or more generally in formal logic we assume: if premises are true then conclusions are also true because we are dealing with deductively valid propositions.

But when we draw truth-table of $P\to Q$ we come across one paradox. That is,

When $P$ is false, and $Q$ is true, $P\to Q$ is still true!

Why so? How can premise (deductively valid proposition or antecedent) be false with a conclusion (deductively valid proposition or consequent) be true, and their implication be still TRUE!

Reading through the explanations given on the question:

In classical logic, why is $(p\Rightarrow q)$ True if $p$ is False and $q$ is True?

It is bit clear with the given examples that: When $P$ is false, and $Q$ is true, $P\to Q$ is true in some situations.

Out of given examples I am selecting example given by Jai [3rd top answer on that page] which in fact comes from this webpage:

"If you get an A, then I'll give you a dollar."

What if it's false that you get an A? Whether or not I give you a dollar, I haven't broken my promise.

Does this mean that if I get A+ or B- or I was ill for the exam, I will still get a dollar as promised?

Because, I thought propositions are rigid and their use in conditional should be consider as-is without changing the meaning of them, then what is intended by the author of the given example. Here, it is very clear that author of the example suggest that; it is a necessary condition for "Get an A" is "I'll give you a dollar" and a sufficient condition for "I'll give you a dollar" is "Get an A".

Is there any further explanation: The premise (antecedent) requires further support or can be overlooked or ignored in order for conclusion (consequent) to be true when antecedent is false and consequent is true?

Ubi.B
  • 340
  • This has a long history (Aristotle) : in the Middle Ages students had to learn : "ex falso quodlibet sequetur" : out of a false premissa you can deduce whatever you want... – Jean Marie Feb 03 '19 at 15:38
  • Sorry. A copy/paste error ; the similar question was https://math.stackexchange.com/q/1583209 – Jean Marie Feb 03 '19 at 18:17
  • @JeanMarie "ex falso quodlibet sequitur" is not valid for this situation. Here, P->Q are just propositions they are not premise and conclusion. Hence, they are not proving something. – Ubi.B Feb 04 '19 at 05:49
  • You are right. Reference to Aristotelician logic is important for didactic purposes, but can be a little misleading when when we go into the details. – Jean Marie Feb 04 '19 at 07:46
  • I erase my part of the last comments that aren't useful for others ! – Jean Marie Feb 04 '19 at 11:06
  • Dan's linked article is bogus, because it is based on a complete confusion between semantics and syntactic deduction. – user21820 Oct 01 '21 at 12:43

2 Answers2

2

You seem to be rather confused ....

You write:

When we talk about formal logic, we generally agree that $P$ and $Q$ are deductively valid arguments (propositions).

No, we don't agree on that at all. $P$ and $Q$ are statements, or propositions, or claims. But they are not arguments!

You also write:

And further when we talk about implication or material/concrete conditional $P\to Q$ we assume: "if $P$ is true, then $Q$ is also true" or more generally in formal logic we assume: if premises are true then conclusions are also true because we are dealing with deductively valid propositions.

In a conditional $P \to Q$, the antecedent is $P$ and the consequent is $Q$. But the antecedent is not a premise, and the consequent is not a conclusion. $P \to Q$ is just a statement, not an argument. And if there is on argument, then there are no premises and conclusion either.

You ask:

But when we draw truth-table of $P\to Q$ we come across one paradox. That is,

When $P$ is false, and $Q$ is true, $P\to Q$ is still true!

Why so? How can premise (deductively valid proposition or antecedent) be false with a conclusion (deductively valid proposition or consequent) be true, and their implication be still TRUE!

Again, we are not dealing with any premises or conclusions here, just propositions. and the propositions themselves need not be valid at all.

But, in answer to your question why $P \to Q$ is true when $P$ is false and $Q$ is true: I always like this explanation for why $F \to T$ should be set to True:

Consider the statement $(P \land Q) \to Q$. Now, that of course should always true since $Q$ logically follows from $P \land Q$. OK, so now plug in $P=F$ and $Q=T$. Then you get:

$(P \land Q) \to Q = (F \land T) \to T = F \to T$

But like we said, $(P \land Q) \to Q$ should always be true, and so $F \to T=T$

You ask:

"If you get an A, then I'll give you a dollar."

What if it's false that you get an A? Whether or not I give you a dollar, I haven't broken my promise.

Does this mean that if I get A+ or B- or I was ill for the exam, I will still get a dollar as promised?

No, it does not mean that. If you get an A+ or B-, you may still get a dollar, but you may not. What is true, however, is that whether you get a dollar or not, the promise has not been broken, and hence "if you get an A, then you get a dollar" is considered true.

In short, the whole conditional is true as soon as its antecedent is false, and in particular you have that if the antecedent is false, and the consequent is true, the conditional is true.

But given the truth of the conditional, if its antecedent is false, that does not mean its consequent is true.

You also ask:

The premise (antecedent) requires further support or can be overlooked or ignored in order to for conclusion (consequent) to be true when antecedent is false and consequent is true?

Again, antecedent $\not =$ premise, and consequent $\not =$ conclusion!

Also, if you know the antecedent is false, in what sense would it be overlooked? And if the consequent is true, then why would we need to seek further support for it to be true?

I think you are asking one of two questions here (or maybe both):

Why is $P \to Q$ true as soon as $P$ is false, regardless of the value of $Q$?

Why is $P \to Q$ true as soon as $Q$ is true, regardless of the value of $P$?

Well, the previous example can be extended to also cover both the $P=Q=T$ and $P+Q=F$ cases as well. When $P$ and $Q$ are both true:

$(P \land Q) \to Q = (T \land T) \to T = T \to T$

And again, since $(P \land Q) \to Q$ should always be true, we get $T \to T=T$

Likewise, when they are both false:

$(P \land Q) \to Q = (F \land F) \to F = F \to F$

And yet again, since $(P \land Q) \to Q$ should always be true, we get $F \to F=T$

OK, to sum up: we get $F \to T=T$, $T \to T=T$, and $F \to F=T$

The first two should that $P \to Q$ should be true whenever $Q$ is true, no matter the value of $P$.

The first and the third show that $P \to Q$ should be true whenever $P$ is false, no matter the value of $Q$.

I hope that answers all your questions.

Bram28
  • 100,612
  • 6
  • 70
  • 118
  • I appreciate your effort, but previous as well as your answer fails to explain that why antecedent is so insignificant in implication that truth value depends in this scenario only on consequent. – Ubi.B Feb 03 '19 at 17:55
  • The scenario about the getting an A and getting a dollar is supposed to illustrate that if the antecedent is false, the conditional is true, regardless of the value of the consequent. You are now asking a totally different question: why the conditional is true when the consequent is true, regardless of the value of the antecedent. So ... what question is it you want an answer to? Please make that clear in your original post. – Bram28 Feb 03 '19 at 18:03
  • @EVG I extended my Answer to show that the conditional should be true whenever the consequent is true, regardless of the value of the antecedent. – Bram28 Feb 03 '19 at 18:08
  • I have updated my answer little bit more. – Ubi.B Feb 03 '19 at 18:21
  • @EVG I see two questions in your post: 1) why is $P \to Q$ true when $P$ is false and $Q$ is true? 2) why is $P \to Q$ true when $P$ is false, regardles of value of $Q$? Neither of these is the question you asked in your previous comment: 3) why is $P \to Q$ true when $Q$ is true, regardless of value of $P$? If you want that question answered as well, you'll need to add it to your post. In the meanwhile, I'll update my answer to show how my method can answer all three questions ... – Bram28 Feb 03 '19 at 19:12
  • Your answer is nice. I still have some query to ask you. I will surely accept this answer. I will come back after some time. – Ubi.B Feb 04 '19 at 05:52
  • So, if I have understood it correctly, then (P->Q) a wff is a statement/proposition and with that P (antecedent) and Q (consequent) itself are statements/propositions because P and Q are itself wff by definition (of wff). I have read it in first chapter that locution like $Either...Or$, $If...Then$ should be consider as one unit, right? Secondly, according to you or in general, F->T is T is not a paradox in itself, right? Really, thank you very much because you tried to understand my mind and provided answer with great interest. – Ubi.B Feb 04 '19 at 12:36
  • Also, I was utterly confused with material implication and logical implication. – Ubi.B Feb 04 '19 at 13:01
  • Can you please look into 2nd page of Rutger Uni. http://www.cs.rutgers.edu/~elgammal/classes/cs205/implication.pdf It clearly that's that P: hypothesis, premise, antecedent and Q: conclusion, consequence while talking about implication. – Ubi.B Feb 04 '19 at 15:18
  • @EVG Thanks. Yes, that document mixes up material and logical implication and treats them as one and the same. What is of course not helping is that in English we can use 'if ... then ...' statements to express both conditionals (material implications) as well as inferences (logical implications). Still, in formal logic there is a very clear distinction: A material implication is a logical connective that constructs a new proposition out of others. A statement like 'If you do all the HW's then you get an A in the course' is like that. – Bram28 Feb 04 '19 at 16:23
  • @EVG On the other hand, logical implication is a statement being a logical consequence of some other statement. Note that getting an A in the course is not logically implied by doing all the HW's: this particular course and instructor has a kind of 'contract' that you get an A when you do all the HW's, but this is not logically implied, because we can easily imagine w world where you do all the HW's and still not get an A. An example of a logical implication would be more like: "I do all the HW's. If I do all the HW's I get an A. Therefore, I get an A". It's a deductively valid argument. – Bram28 Feb 04 '19 at 16:26
  • @EVG Material implications are symbolized using $\to$. Logical implications are symbolized using $\Rightarrow$ or $\vDash$. Material implications are symbols of the logical language: a language used to express statements. Logical implications are symbols of the meta-logical language: a language used to say things about statements of the logic language. – Bram28 Feb 04 '19 at 16:28
  • thank you so much! Finally, resolved. – Ubi.B Feb 04 '19 at 16:51
  • @EVG You're welcome. It's confusing! And, it doesn't help when the notation isn;t used consistently. For example, in Dan's answer, he uses the $\Rightarrow$ to express a material conditional. Please note that is pretty unusual ... but unfortunately it happens ... and so that does not help distinguishing between these two different notions. – Bram28 Feb 04 '19 at 17:01
1

Classical logic can only be applied to proposition(s) that are unambiguously either true or false at the moment. It has nothing to do with cause and effect, or the passage of time. It deals with things that are true, not things that will be true. I don't think your example fits into that mold.

In any case, for propositions $A$ and $B$, we can prove that $A \implies B$ follows from $\neg A$.

We can prove that $\neg A \implies (A \implies B)$ is a tautology using a truth table. The truth table, however, is based on the standard definition:

$$A\implies B \space\equiv\space \neg (A \land \neg B)$$

Both, however, can be derived using only the following rules of natural deduction:

  1. Conditional proof ($\implies$ intro)
  2. Proof by contradiction ($\neg$ intro)
  3. Joining a pair of statements using conjunction ($\land$ intro)
  4. Splitting up a conjunction into a pair of statements ($\land$ elim)
  5. Detachment ($\implies$ elim)
  6. Removing double negation ($\neg\neg$ elim)

EDIT

See my blog posting on this topic.