For example, is $(X \vee 1)$ a valid formula in conjunctive normal form (CNF)?
If yes, then I would have to consider such formulas when trying to prove a statement about all CNF formulas.
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this communityFor example, is $(X \vee 1)$ a valid formula in conjunctive normal form (CNF)?
If yes, then I would have to consider such formulas when trying to prove a statement about all CNF formulas.
$X \vee 1$ is not a CNF formula because $1$ is neither a variable nor the negation of a variable. Both $X$ and $\neg X$ are valid CNF formulas, however.