In mathematical logic, a Hintikka set is a set of logical formulas whose elements satisfy the following properties:
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.
In a semantic tableau for propositional logic, Hintikka sets can be defined using uniform notation for propositional tableaux. The elements of a propositional Hintikka set S satisfy the following conditions: [1]
If a set S is a Hintikka set, then S is satisfiable.
In mathematical logic, a Hintikka set is a set of logical formulas whose elements satisfy the following properties:
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.
In a semantic tableau for propositional logic, Hintikka sets can be defined using uniform notation for propositional tableaux. The elements of a propositional Hintikka set S satisfy the following conditions: [1]
If a set S is a Hintikka set, then S is satisfiable.