Skip to content Skip to navigation

Connexions

You are here: Home » Content » Propositional Logic: soundness and completeness revisited

Navigation

Recently Viewed

This feature requires Javascript to be enabled.

Propositional Logic: soundness and completeness revisited

Module by: Ian Barland, John Greiner, Phokion Kolaitis, Moshe Vardi, Matthias Felleisen. E-mail the authors

User rating (How does the rating system work?)
Ratings

Ratings allow you to judge the quality of modules. If other users have ranked the module then its average rating is displayed below. Ratings are calculated on a scale from one star (Poor) to five stars (Excellent).

How to rate a module

Hover over the star that corresponds to the rating you wish to assign. Click on the star to add your rating. Your rating should be based on the quality of the content. You must have an account and be logged in to rate content.

:
(0 ratings)

Summary: Considering the soundness and completeness of inference rules.

Note: Your browser may not currently support MathML. See our browser support page for additional details. You can always view the correct math in the PDF version.

The folly of mistaking a paradox for a discovery, a metaphor for a proof, a torrent of verbiage for a spring of capital truths, and oneself for an oracle, is inborn in us. — Paul Valery, poet and philosopher (1871-1945)

Throughout this discussion, we've implicitly assumed that if we've proven something, it must be true. But we should be careful: What if one of those listed inference rule isn't always valid? What if we introduced a new rule? (Sure, you'd probably balk if we proposed something silly like a∨b⇒a a b a , or even more degenerately false. But what about some more reasonable-sounding rule?) What if our new rule introduces an inconsistency, when combined with the other rules in a some complicated way? In fact, are we absolutely certain that this can't already happen with the inference rules we have?! This brings us back to the questions of soundness and completeness of a proof system. Fortunately, the system presented here is both sound and complete (though proving this is beyond our current scope). However, we can rest assured, that for propositional logic, what we can prove really does correspond entirely to what is true.

Exercise 1

If we omitted the RAA inference rule, would this new system be sound? Would it be complete?

Solution

It would be sound: Look at all the possible proofs that can be made in the original system; all those proofs lead to true conclusions (since that original system is sound, as we're claiming). If we just discard all those that include RAA, the remaining proofs are still all true, so the smaller system is sound.

It would not be complete, though: As pointed out, RAA is our only way to prove negations without premises. There are negated formulas that are true (and have no premises) — for example ¬false. Without RAA, we cannot provide a proof of ¬false, so the smaller system is incomplete.

Content actions

Give Feedback:

E-mail the module authors | Rate module ( How does the rating system work?)

Rating system

Ratings

Ratings allow you to judge the quality of modules. If other users have ranked the module then its average rating is displayed below. Ratings are calculated on a scale from one star (Poor) to five stars (Excellent).

How to rate a module

Hover over the star that corresponds to the rating you wish to assign. Click on the star to add your rating. Your rating should be based on the quality of the content. You must have an account and be logged in to rate content.

(0 ratings)

Download:

Module PDF

Add module to:

My Favorites (?)

'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.

| A lens (?)

Definition of a lens

Lenses

A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

What is in a lens?

Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

Who can create a lens?

Any individual Connexions member, a community, or a respected organization.

What are tags? tag icon

Tags are descriptors added by lens makers to help label content, attaching a vocabulary that is meaningful in the context of the lens.

| External bookmarks