Uncommon · Knowledge
True quantified Boolean formula
Problem of deciding the satisfiability of a true quantified Boolean formula
In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean formula is a formula in quantified propositional logic (also known as Second-order propositional logic) where every variable is quantified (or bound), using either existential or universal quantifiers, at the beginning of the sentence.
From Wikipedia
In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean formula is a formula in quantified propositional logic (also known as Second-order propositional logic) where every variable is quantified (or bound), using either existential or universal quantifiers, at the beginning of the sentence. Such a formula is equivalent to either true or false (since there are no free variables). If such a formula evaluates to true, then that formula is in the language TQBF. It is also known as QSAT (Quantified SAT).
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
★★★
Boolean algebra
Branch of algebra abstracting logical operations
-
M★★★
Molecular formula
Chemical formula in which elements are counted within molecules
-
★★
Real-time polymerase chain reaction
Laboratory technique of molecular biology based on the polymerase chain reaction (PCR)
-
S★
Sequent
Conditional assertion that if all of the antecedent conditions are true, then at least one of the consequent formulas is true
-
C★★
Conjunctive normal form
Concept in Boolean logic
-
C★★
Continued fraction
Generalization of continued fractions in which the partial numerators and partial denominators can assume arbitrary complex values