Hintikka set
In mathematical logic, a Hintikka set is a set of logical formulas whose elements satisfy the following properties: # An atom or its conjugate can appear in the set but not both, # If a formula in the set has a main operator that is of…
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematical logic, a Hintikka set is a set of logical formulas whose elements satisfy the following properties: # An atom or its conjugate can appear in the set but not both, # If a formula in the set has a main operator that is of "conjunctive-type", then its two operands appear in the set, # If a formula in the set has a main operator that is of "disjunctive-type", then at least one of its two operands appears in the set. The exact meaning of "conjunctive-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 mathematical logic, a Hintikka set is a set of logical formulas whose elements satisfy the following properties: An atom or its conjugate can appear in the set but not both, If a formula in the set has a main operator that is of "conjunctive-type", then its two operands appear in the set, If a formula in the set has a main operator that is of "disjunctive-type", then at least one of its two operands appears in the set. The exact meaning of "conjunctive-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.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1354806351 under CC BY-SA 4.0; modifications have been made.