Skip to content Skip to navigation

Connexions

You are here: Home » Content » Reference: propositional equivalences

Navigation

Content Actions
  • Download module PDF
  • Add to ...
    Add the module to:
    • My Favorites
    • A lens
    • An external social bookmarking service
    • My Favorites (What is '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 (What is 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.

    • External bookmarks
  • E-mail the authors

Recently Viewed

This feature requires Javascript to be enabled.

Reference: propositional equivalences

Module by: Ian Barland, John Greiner, Phokion Kolaitis, Moshe Vardi, Matthias Felleisen

Summary: (Blank Abstract)

The following lists some propositional formula equivalences. Remember that we use the symbol ≡≡ as a relation between two WFFs, not as a connective inside a WFF. In these, φφ, ψψ, and θθ are meta-variables standing for any WFF.

Propositional Logic Equivalences
Double Complementation ¬¬φ≡φ φ φ
Complement φ∨¬φ≡true φ φ φ∧¬φ≡false φ φ
Identity φ∨false≡φ φ φ φ∧true≡φ φ φ
Dominance φ∨true≡true φ φ∧false≡false φ
Idempotency φ∨φ≡φ φ φ φ φ∧φ≡φ φ φ φ
Absorption φ∧φ∨ψ≡φ φ φ ψ φ φ∨φ∧ψ≡φ φ φ ψ φ
Redundancy φ∧¬φ∨ψ≡φ∧ψ φ φ ψ φ ψ φ∨¬φ∧ψ≡φ∨ψ φ φ ψ φ ψ
DeMorgan's laws ¬φ∧ψ≡¬φ∨¬ψ φ ψ φ ψ ¬φ∨ψ≡¬φ∧¬ψ φ ψ φ ψ
Associativity φ∧ ψ∧θ ≡ φ∧ψ ∧θ φ ψ θ φ ψ θ φ∨ ψ∨θ ≡ φ∨ψ ∨θ φ ψ θ φ ψ θ
Commutativity φ∧ψ≡ψ∧φ φ ψ ψ φ φ∨ψ≡ψ∨φ φ ψ ψ φ
Distributivity φ∧ψ∨θ≡φ∧ψ∨φ∧θ φ ψ θ φ ψ φ θ φ∨ψ∧θ≡φ∨ψ∧φ∨θ φ ψ θ φ ψ φ θ

Equivalences for implication are omitted above for brevity and for tradition. They can be derived, using the definition a⇒b≡¬a∨b a b a b .

Example 1

For example, using Identity and Commutativity, we have true⇒b≡¬true∨b≡false∨b≡b∨false≡b b b b b b .

Comments, questions, feedback, criticisms?

Send feedback