logic - Converting Normal Form to CNF -


in cs logic class have convert normal form boolean expressions cnf, kind of stuck on one.

¬(¬p => (p => q))

which is:

¬(¬p => (¬p or q)) implication elimination

¬(¬¬p or (¬p or q)) implication elimination

¬(p or (¬p or q)) double negation

¬p , ¬(¬p or q)) demorgan's

¬p , (¬¬p , ¬q)) demorgan's

¬p , (p , ¬q)) double negation

the next step distribute or on and, there aren't or distribute.

once reach

  • ¬(p or (¬p or q)) double negation

you have

  • ¬((p or ¬p) or (p or q)) distribution
  • ¬(true or (p or q)) excluded middle
  • ¬(true) null element of or
  • false obviousness :p

Comments

Popular posts from this blog

java - Run spring boot application error: Cannot instantiate interface org.springframework.context.ApplicationListener -

reactjs - React router and this.props.children - how to pass state to this.props.children -

Excel VBA "Microsoft Windows Common Controls 6.0 (SP6)" Location Changes -