Seon-Ho Park's Blog (sunoblog) Study on Computer Science, Security, Model

13Jul/106

Quantifier Equivalences in Predicate Logic

Theorem for Quantifier Equivalences
  1. \neg \forall x \phi \dashv \vdash \exists x \neg \phi
  2. \neg \exists x \phi \dashv \vdash \forall x \neg \phi
  3. \forall x \phi \wedge \psi \dashv \vdash \forall x (\phi \wedge \psi)
  4. \forall x \phi \vee \psi \dashv \vdash \forall x (\phi \vee \psi)
  5. \exists x \phi \wedge \psi \dashv \vdash \exists x (\phi \wedge \psi)
  6. \exists x \phi \vee \psi \dashv \vdash \exists x (\phi \vee \psi)
  7. \forall x (\psi \rightarrow \phi) \dashv \vdash \psi \rightarrow \forall x \phi
  8. \exists x (\phi \rightarrow \psi) \dashv \vdash \forall x \phi \rightarrow \psi
  9. \forall x(\phi \rightarrow \psi) \dashv \vdash \exists x \phi \rightarrow \psi
  10. \exists x(\psi \rightarrow \phi) \dashv \vdash \psi \rightarrow \exists x \phi
  11. \forall x \phi \wedge \forall x \psi \dashv \vdash \forall x (\phi \wedge \psi)
  12. \exists x \phi \vee \exists x \psi \dashv \vdash \exists x (phi \vee \psi)
  13. \forall x \forall y \phi \dashv \vdash \forall y \forall x \phi
  14. \exists x \exists y \phi \dashv \vdash \exists y \exists x \phi
 Assuming~that~x~is~not~free~in~\psi,~for~theorem3-10.

Comments (6) Trackbacks (0)
  1. Actually, this post is for testing WP Latex, but that theorem is also important to me.

  2. It’s posts like this that keep me coming back and checking this site regularly, thanks for the info!

  3. Genial brief and this fill someone in on helped me alot in my college assignement. Thank you for your information.

  4. Thankxs For share it really help me! This is greate info for me….

  5. lovely principles you’ve documented on this website. This has been


Leave a comment


No trackbacks yet.