I am looking for help with Predicate and Quantitative Logic.
Provide proofs for the attached 4 problems using the 9 rules of inference, the 10 rules of replacement and Quantitative logic.

---
Provide proof s for the following four arguments using:

The 9 rules of inference; Modus Pollens (MP); Modus Tollens (MT); Hypothetical Syllogism (HS);
Disjunctive Syllogism (DS); Constructive Dilemna (CD); Absorption (Abs); Simplification (Simp);
Conjuction (Conj); and Addition (Add)

The 10 rules of replacement: DeMorgans Theorems (DeM); Commutation (Com); Association (Assoc);
Distribution (Dist);Double Negation (DN); Transposition (Trans); Implication (Impl);
Equivalence (Equiv); Exportation (Exp); and Repetition (Rep)

Quantification Logic: Universal Instantiation (UI); Universal Generalization (UG); Existential
Generalization (EG); Existential Instantiation (EI) and Change of Quantifier Rules (CQ)

For each of problems,
? Write a symbolic version of the given statement
? Construct a negation of the symbolic statement
? Translate the symbolic negation into good, lucid English.
Problem A: "All the routers in our facility support both hard-wired and wireless Internet connections."
Problem B: "Each of our salespersons h

The sentence below is a theorem of predicate logic. Show that it is by deriving it from the null set of premises. If any "individual" in the domain has a property, then every individual has it. I need help explaining this and with the derivation.
(EX)(FX --->(Y)FY)

See the attachment for all questions.
18. Given: If you are wealthy, then you are a success.
You are wealthy or you are. healthy.
You are not healthy.
Let W represent: "You are wealthy." Let S represent: "You are a success." Let H represent: "You are healthy."
Prove: You are a success.
19. Given: The object i

Let L be the language of addition (with equality) in first-order logic. That is, let L be the first-order language that allows for use of the equality symbol ("=") and whose only non-logical symbol is a binary function symbol "+". (That is, L has no constant symbols and no predicate (relation) symbols.)
Now consider the L-str

Question 1.
Translate each of the following statements into the notation of logic and predicatelogic and simplify the negations of all. Which statements do you think are true?
(i) Some questions are easy.
(ii) Any integer with an even square is even.
(iii) All students cannot correctly answer some questions in this assignme

Draw a slash mark (/) between the complete subject and the complete predicate in the sentences below. Identify the simple subject and underline the simple predicate.
1. The whole family travels in our new camper.
2. Everybody helps to pitch the tent under a tree.
3. They will use a compass on their hike.
4. A good f

Please help me learn how to write these two proofs correctly for my Modern Algebra class.
Please submit all work as either a PDF or MS Word file.
** Please see the attached file for the complete problem description **

Consider the compound statement (P ^ Q) V (~ P ^ R)
a) Find the truth table for the statement.
b) IS the statement a tautology?
c) In the following program code, what has to be the output for the answr to be "yes"?
...
2. Given the following sets A = {1.2,3.4}, B = {2,3,4,5}, and C= {2,4,6}
a) Find ....
4. Prove that

Describe the steps in and/or define how to accomplish the following types of proofs:
a. That two sets are equal.
b. That two sets are disjoint.
c. A proof by contra-positive.
d. A proof by contradiction.
e. A proof by Mathematical Induction.
(Question is repeated in attachment)