Hintikka set

From Maths
Jump to: navigation, search
Stub grade: A
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Currently being created, could use other references

Definition

Let L be a first order language and suppose H is the Herbrand domain of L. We say that Ω is the Hintikka set with respect to H if Ω is a set of formulas that satisfy the following 7 conditions[1]:

  1. If A is an atomic formula then either AΩ or ¬AΩ but not both Caution:XOR is speculation on my part
    • With regards to the equality symbol, we require ttΩ, where tH Caution:Check, could be any term?
  2. If AΩ then ¬¬AΩ
  3. If (AΩ or BΩ) then ABΩ, additionally:
    • If (¬AΩ and ¬BΩ) then ¬(AB)Ω
  4. If (AΩ and BΩ) then ABΩ, additionally:
    • If (¬AΩ or ¬BΩ) then ¬(AB)Ω
  5. If (¬AΩ or BΩ) then (AB)Ω, additionally:
    • If (AΩ and ¬BΩ) the ¬(AB)Ω
  6. SAVING WORK

References

  1. Jump up Mathematical Logic - Foundations for Information Science - Wei Li

Template:Formal logic navbox