1 / 15

Completeness and Consistency

Completeness and Consistency. So far we have 11 rules. PA, and an In and an Out rule for each of 5 connectives. Call this system of 11 rules: P. Completeness and Consistency. So far we have 11 rules. PA, and an In and an Out rule for each of 5 connectives.

ecurtin
Télécharger la présentation

Completeness and Consistency

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Completeness and Consistency So far we have 11 rules. PA, and an In and an Out rule for each of 5 connectives. Call this system of 11 rules: P

  2. Completeness and Consistency So far we have 11 rules. PA, and an In and an Out rule for each of 5 connectives. Call this system of 11 rules: P Worry: Do we have enough rules? Are there valid arguments that have no proofs in P?

  3. Completeness and Consistency So far we have 11 rules. PA, and an In and an Out rule for each of 5 connectives. Call this system of 11 rules: P Worry: Do we have enough rules? Are there valid arguments that have no proofs in P? There is a reason to worry. Irvin Copi’s first book had 25 rules, but there are valid arguments that can’t be proven in it.

  4. Completeness and Consistency So far we have 11 rules. PA, and an In and an Out rule for each of 5 connectives. Call this system of 11 rules: P Worry: Do we have enough rules? Are there valid arguments that have no proofs in P? Luckily we can prove that P is has all the rules its needs. If an argument is valid then it is provable in P.

  5. Completeness and Consistency Definition of Completeness: A system is complete iff If an argument is valid then it can be proven in the system.

  6. Completeness and Consistency Definition of Completeness: A system is complete iff If an argument is valid then it can be proven in the system. Luckily we can prove that P is complete: If an argument is valid then it is provable in P. Unfortunately Copi’s 25 rule system is not complete, despite its large number of rules.

  7. Completeness and Consistency A second worry: Can you prove any invalid arguments in P? (That would be a disaster!)

  8. Completeness and Consistency A second worry: Can you prove any invalid arguments in P? (That would be a disaster!) You might think we are safe: Each rule is clearly valid, and proofs use only valid arguments.

  9. Completeness and Consistency A second worry: Can you prove any invalid arguments in P? (That would be a disaster!) You might think we are safe: Each rule is clearly valid, and proofs use only valid arguments. However more than once in history logicians have developed systems of rules that allowed one to prove everything!

  10. Completeness and Consistency Definition of Consistency A system is consistent iff If an argument can be proven in the system, then itis valid.

  11. Completeness and Consistency Definition of Consistency A system is consistent iff If an argument can be proven in the system, then itis valid. Fortunately it has been verified that P never proves invalid arguments.

  12. Completeness and Consistency A system is complete iff If an argument is VALID then it can be PROVEN in the system. A system is consistent iff If an argument can be PROVEN in the system, then itis VALID.

  13. Completeness and Consistency A system is complete iff If an argument is VALID then it can be PROVEN in the system. V>P A system is consistent iff If an argument can be PROVEN in the system, then itis VALID.

  14. Completeness and Consistency A system is complete iff If an argument is VALID then it can be PROVEN in the system. V>P A system is consistent iff If an argument can be PROVEN in the system, then itis VALID. P>V

  15. Completeness and Consistency A system is complete iff If an argument is VALID then it can be PROVEN in the system. V>P A system is consistent iff If an argument can be PROVEN in the system, then itis VALID. P>V V<>P For more click here

More Related