# Symbolic Logic Problem : Proof

Not what you're looking for?

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

##### Purchase this Solution

##### 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.

##### 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 ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.