Question: 34.2-8 Let be a boolean formula constructed from the boolean input variables xi, X2. , , , , Xk, negations (-). ANDs (A), ORs (V),

34.2-8 Let be a boolean formula constructed from the boolean input variables xi, X2. , , , , Xk, negations (-). ANDs (A), ORs (V), and parentheses. The formula is a tautology if it evaluates to 1 for every assignment of 1 and 0 to the input variables. Define TAUTOLOGY as the language of boolean formulas that are tautologies. Show that TAUTOLOGY E co-NP
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
