Explore BrainMass

# Symbolic Logic Problem : Proof

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

Construct a formal proof which shows that the sentence below is a theorem of predicate logic. *the E's are existential quantifiers (usually designated by backwards E's). the & are "and". Do not use quantifier negation rules.

[(x)(~Rx or Nx)& ~(Ex)Nx or (Ey)(z)Szy] ->(~(Ex)Rx or (z)(Ey)Szy

© BrainMass Inc. brainmass.com March 4, 2021, 5:48 pm ad1c9bdddf
https://brainmass.com/math/discrete-math/symbolic-logic-problem-proof-11566

#### Solution Preview

Please see the attached file for the complete solution.
Thanks for using BrainMass.

Construct a formal proof which shows that the sentence below is a theorem of predicate logic. *the E's are existential quantifiers ...

#### Solution Summary

A formal proof is provided to how that a sentence is a theorem of predicate logic. Existential quantifiers and negation rules are analyzed.

\$2.49