Shantila's Inside Logic #15

Consistency

A set of sentences is consistent just in case it would be possible for all the sentences in the set to be true together. If so, a contradiction cannot be derived from that set of sentences. So a set of sentences is not consistent (that is, it is inconsistent) just in case a contradiction can be derived from that set.

Consider, for example, this set of four sentences. Although it may not be obvious given a quick reading of these four sentences, it is not possible for all four of these sentences to be true: this set is inconsistent.

Joe is happy and so are you.

You are sharing your lunch if you are happy.

If you sharing your lunch but you are not giving any to Joe, then he isn't happy.

You are not giving any of your lunch to Joe.

We can represent these sentences as follows, using the following symbols. J: Joe is happy. H: You are happy. L: You are sharing your lunch. G: You are giving some of your lunch to Joe.

J & H

H > L

(L & ~G) > ~J

~G

Is this set of four sentences consistent? The answer is No!

We can show the set is not consistent by deriving a contradiction from these four sentences, as follows.

  1 1. J & H A    
  2 2. H > L A    
  3 3. (L & ~G) > ~J A    
  4 4. ~G A    
  1 5. H 1, &E    
  1,2 6. L 2,5 MP  
  1,2,4 7. L & ~G 4,6 &I        
  1,2,3,4 8. ~J 3,7 MP        
  1 9. J 1, &E            
  1,2,3,4 10. J & ~J 8,9 &I            

What this derivation shows is that the four sentences (the premises here) are inconsistent (that is, not consistent). Line 10 says that given the four premises, it follows that J&~J, which is a contradiction: this set of four sentences entails a contradiction. --And this means that at least one of the sentences must be false. It is impossible for all four sentences to be true.

Given any of the three as premises in this example, we could use RA to derive the negation of the other premise. On line 10 we have a proof of a contradiction based on lines 1,2,3, and 4. So, for example, we can add line 11 (using RA, of course) to show that the first 3 premises entail ~~G, and so also then line 12, G.

  1,2,3 11. ~~G 4,10 RA    
  1,2,3 12. G 11, DN            

But equally we could have negated line 1 based on the other three sentences. So a different step from line 10 would be as follows:

  2,3,4 11. ~(J & H) 1, 10 RA          

Logic by itself will of course not tell use which of the four sentences to reject -- but it does tell us that certainly at least one of the four sentences must be false.

*

Here's another example, from current cosmology and physics. Many cosmologists currently believe the following.

(1) Most of the matter in the universe is "dark" (i.e. cannot be detected from the light which it emits).

Dark matter is "stuff" which cannot be seen directly (at least, we have no means of "seeing" it at this point.) So what makes us think that it exists at all? Its presence is inferred indirectly from the motions of astronomical objects (stars, galaxies and galaxy cluster/superclusters). These motions cannot be explained without assuming there is great deal more matter in the universe than we understand. The term "dark" matter is used to refer to this stuff that needs to be posited in order to explain the motions that are observed. (This is actual science, not science fiction!)

But some theorists have argued against this view, claiming

(2) If most of the matter in the universe is dark, it would have prevented the existence of everything we know in our cosmos.

According to this alternative theory, the existence of dark matter would undermine the very existence of the things with which we are familiar.

Common sense kicks in to say (3) If dark matter prevented the existence of everything we know in our cosmos, then nothing we know about exists now; and yet (4) It is not true that nothing we know about exists now!

These four sentences can be represented as follows:

(1) D

(2) D>P

(3) P>N

(4) ~N

It is easy for us to show that (1)-(4) here comprise an inconsistent set of sentences.

  1 1. D A    
  2 2. D>P A    
  3 3. P>N A    
  4 4. ~N A    
  3,4 5. ~P 3,4 MT    
  2,3,4 6. ~D 2,5 MT  
  1,2,3,4 7. D&~D 1,6 &I  

We can see (and everyone will agree) that (1)-(4) is an inconsistent set. At least one of them is false. Which one? It is an interesting dispute. The debate will center on whether (1) or (2) should be rejected since (3) and (4) are obviously true. --Of course it might turn out that, based on further research, both (1) and (2) should be rejected.

*

The basic logical notions we have been examining so far (if, and, or, not) are all quite simple. We have understood these notions in their basic forms (as represented in our Rules) since we were children -- as we have said several times before.

Yet our minds are complex. We each have many diverse beliefs and values. And it is quite possible that there are inconsistencies in our minds. One potential value of logic is to alert us to this possiblity.

There is no red flag that shows us automatically that the sentences about Joe and lunch (or the sentences about dark matter) are inconsistent. To see that they are inconsistent we have to "put two and two together." Now when we look closely, we easily can do that-- we can see that they are inconsistent! Indeed it is as simple as 2+2=4 once we understand our rules! But prior to looking closely, we might not realize that there is a problem with the inconsistent sets of sentences. We might have had the intuition they do not cohere together very well but we might not have been able to say why not.

Given the tools we now have in hand, we can spell out what is wrong: the sets are inconsistent. At least one of the sentences in each set must be false. If a set of sentences is inconsistent, we can know on the basis of logic alone that at least one of the sentences must be false.

Of course, logic by itself is not going to tell us which of the sentences is false.

 

* Practice

15.1 Symbolize the sentences in each of the following sets, and for each construct a derivation to show that the set of sentences is inconsistent.

(a) Sally is arriving tomorrow and Larry is cleaning the house. If Larry is cleaning the house then Sally is happy. If Sally is happy but has not called, then she isn't arriving tomorrow. Sally has not called. (S: Sally is arriving tomorrow. L: Larry is cleaning the house. H: Sally is happy. C: Sally has called)

(b) I want to marry Pat only if I adore Pat. Pat does not lie a lot or else I do not adore Pat. Pat lies a lot, yet I want to marry Pat. (M: I want to marry Pat. A: I adore Pat. L: Pat lies a lot.)

(c) Sally is a liberal. She loves life. Sally supports legalized abortion or she is not a liberal. Sally loves life only if she does not support legalized abortion. (S: Sally is a liberal. L: Sally loves life. A: Sally supports legalized abortion.)

(d) God is fair. Jolamba will go to hell unless she is a Christian. Jolamba is not a Christian and, indeed, she has not heard of Christ. If God is fair, then Jolamba will not go hell unless she has heard of Christ. (F: God is fair. H: Jolamba will go to hell. C: Jolamba is a Christian. J: Jolamba has heard of Christ.)

(e) Teresa's feeding tube should not be reinserted if her husband says she didn't want to be kept alive in a comatose state. Her parents want the feeding tube reinserted. Teresa's feeding tube should be reinserted if her parents want it to be reinserted; yet her husband says she didn't want to be kept alive in a comatose state. (T: Teresa's feeding tube should be reinserted. H: Teresa's husband says she didn't want to be kept alive in a comatose state. P: Teresa's parents want the feeding tube reinserted.)

15.2 Use the Rules of our system to construct proofs for each of the following sequents.

90 PvQ, P>R, Q>R } R

91 PvQ, P>~R, Q>~R, ~S>R } S

92 (PvQ)vR, R>S, (PvQ)>S } S

15.3 Each of the following arguments is valid. Symbolize each of the following arguments, and construct derivations to show that each is valid.

(a) Winter is coming in and the air is getting colder. If the air is getting colder, the squirrels are getting anxious. If the squirrels are getting anxious and yet are not hiding nuts, then winter is not coming in. Therefore, squirrels are hiding nuts. (W: Winter is coming in. C: The air is getting colder. A: The squirrels are getting anxious. H: The squirrels are hiding nuts.)

(b) If this recipe does not call for wheat flour or it does not call for yeast, then it is not a recipe for bread. If this recipe calls for yeast, then it is true both that it is a bread recipe and yet it doesn't call for wheat flour. So this recipe does not call for yeast. (W: The recipe calls for wheat flour. Y: This recipe calls for yeast. B: This recipe is a recipe for bread.)

(c) Either he's dead or he's alive. If he's dead, he's going to be boring. If he's alive, he will be doing the same old thing. If he's doing the same old thing, he's going to be boring. Therefore, he's going to be boring.

(d) If Shantila left, the man is sad. So if the man isn't sad, then Shantila didn't leave. (L: Shantila left. S: The man is sad.)

(e) If Shantila left, the man is sad. So it is not true that both Shantila left and the man is not sad. (L: Shantila left. S: The man is sad.)

(f) Joe works for the FBI. It is not true that both Joe works for the FBI and the man with the gun will not go to jail. So the man with the gun will go to jail. (J: Joe works for the FBI. M: The man with the gun will go to jail.)

(g) Toledo or Miami will come in second in the track meet. If Toledo comes in second, then Kent will not win. Kent will win only if Miami does not come in second. The Falcons will win if Kent doesn't. So the Falcons will win. (T: Toledo comes in second in the track meet. M: Miami comes in second in the track meet. K: Kent wins the track meet. F: The Falcons win the track meet.)

(h) Toledo or Miami will come in second, or the Falcons will win. If the Falcons win, Kent will not win. And Kent won't win if either Toledo or Miami comes in second. So Kent won't win.