Skip to content Skip to navigation

Connexions

You are here: Home » Content » First-Order Logic: normal forms revisited

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.

First-Order Logic: normal forms revisited

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

Summary: Using CNF and DNF with first-order-logic.

CNF and DNF revisited (Optional)

In first-order logic, normal forms are still useful for providing a notion of a canonical form. However, their other benefit of corresponding closely to truth tables does not apply here, since truth tables aren't useful for first-order logic.

A formula in Prenex Conjunctive Normal Form, or Prenex CNF, has a body in CNF preceded by a series of quantifiers. Similarly, a formula in Prenex Disjunctive Normal Form, or Prenex DNF, has a body in DNF preceded by a series of quantifiers.

Example 1

Assuming φφ is in CNF, then the following are each in prenex CNF. On the other hand, if φφ is in DNF, these are in prenex DNF.

  • φφ
  • ∀x. φ∀x.φ
  • ∃x. ∀y. ∃z. φ∃x.∀y.∃z.φ

Every formula has an equivalent prenex CNF formula and equivalent prenex CNF formula. For brevity, we'll skip proving this.

Comments, questions, feedback, criticisms?

Send feedback