Hintikka set

In mathematical logic, a Hintikka set is a set of logical formulas whose elements satisfy the following properties:

  1. An atom or its conjugate can appear in the set but not both,
  2. If a formula in the set has a main operator that is of "conjuctive-type", then its two operands appear in the set,
  3. If a formula in the set has a main operator that is of "disjuntive-type", then at least one of its two operands appears in the set.

The exact meaning of "conjuctive-type" and "disjunctive-type" is defined by the method of semantic tableaux.

Hintikka sets arise when attempting to prove completeness of propositional logic using semantic tableaux. They are named after Jaakko Hintikka.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.