TalentJR apps
Textbook: Logic – Class 12 (Balbharati, official free PDF) · pages 17–35
'All singers are creative. Mahesh is a singer. So Mahesh is creative.' Anyone can see this is valid, yet a truth table cannot show it, because each statement is just one letter to propositional logic. Predicate logic opens the statements up into individuals, properties and quantifiers. This chapter teaches you to symbolise singular and general propositions, tell a proposition from a propositional function, and prove validity with the four quantification rules: U.I., U.G., E.I. and E.G. All 30 Q.8 proofs are worked out, and one book error is pointed out.
Propositional logic treats every simple proposition as a single unit, so its methods (truth table, shorter truth table, direct proof, C.P., I.P.) cannot test arguments whose validity depends on how terms inside the propositions are related. Predicate logic analyses the inner structure of non-compound propositions. It includes propositional logic and goes further; any formula valid in propositional logic stays valid in predicate logic.
Non-compound propositions are singular or general. A singular proposition says that a particular individual has (affirmative) or lacks (negative) a property, e.g. 'Ravi is brave' = Br, 'Ravi is not brave' = ~Br. Individual constants are a–w, predicate constants are A–Z, and the predicate letter is written first.
A general proposition is about a class (or the relation between two classes), and is universal or existential, affirmative or negative. That gives eight kinds. One class: (x) φx, (x) ~φx, (∃x) φx, (∃x) ~φx; denying existence uses ~(∃x) φx. Two classes: A (x)(φx ⊃ ψx), E (x)(φx ⊃ ~ψx), I (∃x)(φx • ψx), O (∃x)(φx • ~ψx). Individual variables are x, y, z; predicate variables are φ and ψ.
A propositional function such as Ax or φs contains at least one free variable, so it is neither true nor false. It becomes a proposition by instantiation (putting a constant for the variable, giving a singular proposition) or by quantification/generalisation (putting a universal or existential quantifier before it, giving a general proposition). A variable is bound if it is part of a quantifier or falls within the scope of a matching quantifier; otherwise it is free.
Quantificational deduction adds four rules to the nineteen. U.I. drops a universal quantifier, to any constant or to y. E.I. drops an existential quantifier, but only to a constant not used before in the proof (so use E.I. before U.I.). U.G. restores a universal quantifier, but only from a statement about y. E.G. restores an existential quantifier from any instance.
Get a ✓ Verified tutor for “Predicate Logic” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Symbolise: (a) Not all exams are difficult. (b) Few rivers are clean. (c) Ghosts do not exist.
Answer: (a) (∃x)(Ex • ~Dx). (b) (∃x)(Rx • ~Cx). (c) ~(∃x) Gx.
Prove: 1. (∃x)(Px • Tx) 2. (x)(Tx ⊃ Ax) / ∴ (∃x)(Px • Ax) ('Some poets are teachers; all teachers are patient; so some poets are patient.')
Answer: Valid. Doing E.I. first lets U.I. use the same letter a, so the two premises connect.
| Kind (example) | Symbolisation | Form |
|---|---|---|
| Universal affirmative, one class: Everything is changeable | (x) Cx | (x) φx |
| Universal negative, one class: Nothing is perfect | (x) ~Px | (x) ~φx |
| Existential affirmative: Something is useful / Cats exist | (∃x) Ux / (∃x) Cx | (∃x) φx |
| Existential negative: Something is not safe / There are no dragons | (∃x) ~Sx / ~(∃x) Dx | (∃x) ~φx / ~(∃x) φx |
| A: All roses are plants | (x)(Rx ⊃ Px) | (x)(φx ⊃ ψx) |
| E: No fish is a mammal | (x)(Fx ⊃ ~Mx) | (x)(φx ⊃ ~ψx) |
| I: Some students are athletes | (∃x)(Sx • Ax) | (∃x)(φx • ψx) |
| O: Some fruits are not sweet | (∃x)(Fx • ~Sx) | (∃x)(φx • ~ψx) |
| Singular: Ravi is brave / is not brave | Br / ~Br | φa / ~φa |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q.1 Fill in the blanks (1–15).
Answer: (1) x. (2) φ. (3) Constant. (4) Instantiation. (5) Generalisation. (6) Propositional function. (7) specific. (8) any. (9) E. (10) (x). (11) Proposition. (12) Universal. (13) propositional. (14) predicate. (15) Singular.
2. Q.2 True or false (1–14); Q.3 Match; Q.4 Logical terms (1–13).
Answer: Q.2: (1) False: it is the universal quantifier. (2) True. (3) True. (4) False: that is U.I. (5) False: that describes U.G. (6) True. (7) False: φ is a predicate variable; (x) is the universal quantifier. (8) True. (9) True. (10) True. (11) False: that is propositional logic. (12) False: general propositions do. (13) False: it contains at least one free variable. (14) True. Q.3: (1)–(b), (2)–(e), (3)–(d), (4)–(c), (5)–(f), (6)–(a). Q.4: (1) Propositional logic. (2) Predicate logic. (3) Singular proposition. (4) General proposition. (5) Propositional function. (6) Instantiation. (7) Quantification (generalisation). (8) Individual constant. (9) Predicate constant. (10) Individual variable. (11) Predicate variable. (12) Free variable. (13) Bound variable.
3. Activity boxes: symbolise (1) Nilesh is a singer (2) John is an engineer (3) Ramesh is not a science student (4) Hemangi is smart and Hemangi is creative (5) Zarin is beautiful (6) Amit is an actor but not a dancer (7) Neena is Indian or American (8) New York is not an Australian city. Then: which are propositions? (1) Cx (2) Ma ⊃ Sa (3) (x)(Fx ⊃ Ny) (4) (z)(Az ⊃ ~Tz) (5) (x)(Ay ⊃ ~Wx) (6) By • ~Hx (7) Ta • Fa (8) φs (9) (x)(Gx ⊃ ~Kx) (10) (x)(Rx ⊃ Px) (11) Rx ⊃ Px (12) Ms ∨ Kd
Answer: Symbolise: (1) Sn (2) Ej (3) ~Sr (4) Sh • Ch (5) Bz (6) Aa • ~Da (7) In ∨ An (8) ~An (n = New York, A = Australian city). Propositions: (2), (4), (7), (9), (10), (12). Propositional functions: (1) Cx, (3) y is free, (5) y is free, (6), (8) φ is a free predicate variable, (11).
4. Q.5 Give reasons (1–6) and Q.6 Explain (1–12) in brief.
Answer: Q.5: (1) E.I. must use a constant that has not appeared before; if U.I. has already used it, E.I. needs a new letter and the lines cannot be combined. (2) Only what holds of an arbitrarily chosen individual, with no special features, holds of every member; what is true of a named individual may be special to it. (3) The existential premise says only that at least one thing has the property, not that any thing chosen at random has it. (4) Their validity depends on the inner structure of non-compound propositions, which propositional logic treats as single letters. (5) It contains a free variable, so it makes no definite claim until the variable is replaced or quantified. (6) A singular proposition is about one named individual, so an individual constant is used, not a variable that needs a quantifier. Q.6: U.I., U.G., E.G. and E.I. are as in the notes (statement, symbolic form, restriction). Instantiation: constant for variable, giving a singular proposition. Quantification: quantifier before a function, giving a general proposition (true for (x) only if all instances are true; for (∃x) if one is). Propositional and predicate logic differ in whether the proposition is analysed. Singular vs general: one individual vs a class. Proposition vs function: no free variable, true or false, can be interpreted vs at least one free variable, neither, cannot be interpreted. Quantificational deduction: the 19 rules plus four quantification rules; instantiate, reason, then generalise.
5. Q.7 Symbolise (1–15): (1) No animals lay eggs (2) Everything is valuable (3) Some shopkeepers are not straightforward (4) A few homes are beautiful (5) Hardly any enterprise in the city is bankrupt (6) There are elephants (7) Unicorns do not exist (8) Few bureaucrats are honest (9) A few teenagers like swimming (10) Not a single pupil in the class passed the test (11) All singers are not rich (12) Every child is innocent (13) Few men are not strong (14) Dodos do not exist (15) Nothing is enduring
Answer: (1) (x)(Ax ⊃ ~Ex). (2) (x) Vx. (3) (∃x)(Sx • ~Fx). (4) (∃x)(Hx • Bx). (5) (∃x)(Ex • ~Bx), an O proposition by the book's rule for affirmative 'hardly'. (6) (∃x) Ex. (7) ~(∃x) Ux. (8) (∃x)(Bx • ~Hx), O. (9) (∃x)(Tx • Sx). (10) (x)(Px ⊃ ~Tx). (11) (∃x)(Sx • ~Rx), a denied A gives O. (12) (x)(Cx ⊃ Ix). (13) (∃x)(Mx • Sx), negative 'few' gives I. (14) ~(∃x) Dx. (15) (x) ~Ex.
6. Q.7 Symbolise (16–30): (16) Something is elegant (17) All men are sensible (18) Not all actors are good dancers (19) Rarely businessmen are scientists (20) Not a single story from the book is fascinating (21) All tigers are carnivorous animals (22) No book is covered (23) Some shops are open (24) Some shares are not equity (25) Air tickets are always costly (26) Cunning people are never caring (27) Several banks are nationalised (28) Hardly children are interested in studies (29) Whatever is durable is worth buying (30) Not a single ladder is long
Answer: (16) (∃x) Ex. (17) (x)(Mx ⊃ Sx). (18) (∃x)(Ax • ~Dx). (19) (∃x)(Bx • ~Sx). (20) (x)(Sx ⊃ ~Fx). (21) (x)(Tx ⊃ Cx). (22) (x)(Bx ⊃ ~Cx). (23) (∃x)(Sx • Ox). (24) (∃x)(Sx • ~Ex). (25) (x)(Ax ⊃ Cx). (26) (x)(Cx ⊃ ~Kx) (K = caring). (27) (∃x)(Bx • Nx). (28) (∃x)(Cx • ~Ix). (29) (x)(Dx ⊃ Wx). (30) (x)(Lx ⊃ ~Gx) (G = long).
7. Q.8 (1–6) Construct formal proofs of validity: (1) (x)(Ax ⊃ ~Px), (∃x)(Ox • Px) / ∴ (∃x)(Ox • ~Ax) (2) (x)(Cx ⊃ ~Kx), (x)(~Yx ⊃ Ax), (x)(~Kx ⊃ ~Yx) / ∴ (x)(Cx ⊃ Ax) (3) (x)(~Ax ⊃ ~Sx), (x)(Jx ⊃ ~Ax), Ja / ∴ ~Sa (4) (x)(Dx ⊃ Sx), Dc, Wc / ∴ Sc • Wc (5) (x)(Tx ⊃ Ax), (∃x)(Mx), (x)(Ax ⊃ ~Mx) / ∴ (∃x)(~Ax • ~Tx) (6) (x)(Mx ⊃ Sx), (x)(Nx ⊃ Lx), ~Sa • Na / ∴ ~Ma • La
Answer: (1) 1. (x)(Ax ⊃ ~Px); 2. (∃x)(Ox • Px) / ∴ (∃x)(Ox • ~Ax); 3. Oa • Pa (2, E.I.); 4. Aa ⊃ ~Pa (1, U.I.); 5. Pa • Oa (3, Comm.); 6. Pa (5, Simp.); 7. ~~Pa (6, D.N.); 8. ~Aa (4, 7, M.T.); 9. Oa (3, Simp.); 10. Oa • ~Aa (9, 8, Conj.); 11. (∃x)(Ox • ~Ax) (10, E.G.). (2) 1. (x)(Cx ⊃ ~Kx); 2. (x)(~Yx ⊃ Ax); 3. (x)(~Kx ⊃ ~Yx) / ∴ (x)(Cx ⊃ Ax); 4. Cy ⊃ ~Ky (1, U.I.); 5. ~Yy ⊃ Ay (2, U.I.); 6. ~Ky ⊃ ~Yy (3, U.I.); 7. Cy ⊃ ~Yy (4, 6, H.S.); 8. Cy ⊃ Ay (7, 5, H.S.); 9. (x)(Cx ⊃ Ax) (8, U.G.). (3) 1. (x)(~Ax ⊃ ~Sx); 2. (x)(Jx ⊃ ~Ax); 3. Ja / ∴ ~Sa; 4. ~Aa ⊃ ~Sa (1, U.I.); 5. Ja ⊃ ~Aa (2, U.I.); 6. ~Aa (5, 3, M.P.); 7. ~Sa (4, 6, M.P.). (4) 1. (x)(Dx ⊃ Sx); 2. Dc; 3. Wc / ∴ Sc • Wc; 4. Dc ⊃ Sc (1, U.I.); 5. Sc (4, 2, M.P.); 6. Sc • Wc (5, 3, Conj.). (5) 1. (x)(Tx ⊃ Ax); 2. (∃x)(Mx); 3. (x)(Ax ⊃ ~Mx) / ∴ (∃x)(~Ax • ~Tx); 4. Ma (2, E.I.); 5. Ta ⊃ Aa (1, U.I.); 6. Aa ⊃ ~Ma (3, U.I.); 7. ~~Ma (4, D.N.); 8. ~Aa (6, 7, M.T.); 9. ~Ta (5, 8, M.T.); 10. ~Aa • ~Ta (8, 9, Conj.); 11. (∃x)(~Ax • ~Tx) (10, E.G.). (6) 1. (x)(Mx ⊃ Sx); 2. (x)(Nx ⊃ Lx); 3. ~Sa • Na / ∴ ~Ma • La; 4. Ma ⊃ Sa (1, U.I.); 5. Na ⊃ La (2, U.I.); 6. ~Sa (3, Simp.); 7. ~Ma (4, 6, M.T.); 8. Na • ~Sa (3, Comm.); 9. Na (8, Simp.); 10. La (5, 9, M.P.); 11. ~Ma • La (7, 10, Conj.).
8. Q.8 (7–12) Construct formal proofs of validity: (7) (x)(Px ⊃ Sx), (∃x)(Px • Lx), Pa / ∴ (∃x)(Sx • Lx) (8) (x)(Tx ⊃ Nx), (x)(Nx ⊃ Mx), Td / ∴ Ad ∨ Md (9) (x)(Tx ⊃ Rx), (∃x)(Tx • Nx), (x)(Rx ⊃ Kx) / ∴ (∃x)(Rx • Kx) (10) (x)(Nx ⊃ Hx), ~Hm • Cm / ∴ (∃x)(Cx • ~Nx) (11) (x)((Qx ∨ Rx) ⊃ Tx), (x)Qx / ∴ (x)Tx (12) (x)((Jx ∨ Kx) ⊃ Lx), Ka, (∃x)~Lx / ∴ (∃x)~Jx
Answer: (7) 1. (x)(Px ⊃ Sx); 2. (∃x)(Px • Lx); 3. Pa / ∴ (∃x)(Sx • Lx); 4. Pb • Lb (2, E.I. (b, because a already occurs)); 5. Pb ⊃ Sb (1, U.I.); 6. Pb (4, Simp.); 7. Sb (5, 6, M.P.); 8. Lb • Pb (4, Comm.); 9. Lb (8, Simp.); 10. Sb • Lb (7, 9, Conj.); 11. (∃x)(Sx • Lx) (10, E.G.). (8) 1. (x)(Tx ⊃ Nx); 2. (x)(Nx ⊃ Mx); 3. Td / ∴ Ad ∨ Md; 4. Td ⊃ Nd (1, U.I.); 5. Nd ⊃ Md (2, U.I.); 6. Td ⊃ Md (4, 5, H.S.); 7. Md (6, 3, M.P.); 8. Md ∨ Ad (7, Add.); 9. Ad ∨ Md (8, Comm.). (9) 1. (x)(Tx ⊃ Rx); 2. (∃x)(Tx • Nx); 3. (x)(Rx ⊃ Kx) / ∴ (∃x)(Rx • Kx); 4. Ta • Na (2, E.I.); 5. Ta ⊃ Ra (1, U.I.); 6. Ra ⊃ Ka (3, U.I.); 7. Ta (4, Simp.); 8. Ra (5, 7, M.P.); 9. Ka (6, 8, M.P.); 10. Ra • Ka (8, 9, Conj.); 11. (∃x)(Rx • Kx) (10, E.G.). (10) 1. (x)(Nx ⊃ Hx); 2. ~Hm • Cm / ∴ (∃x)(Cx • ~Nx); 3. Nm ⊃ Hm (1, U.I.); 4. ~Hm (2, Simp.); 5. ~Nm (3, 4, M.T.); 6. Cm • ~Hm (2, Comm.); 7. Cm (6, Simp.); 8. Cm • ~Nm (7, 5, Conj.); 9. (∃x)(Cx • ~Nx) (8, E.G.). (11) 1. (x)((Qx ∨ Rx) ⊃ Tx); 2. (x)Qx / ∴ (x)Tx; 3. (Qy ∨ Ry) ⊃ Ty (1, U.I.); 4. Qy (2, U.I.); 5. Qy ∨ Ry (4, Add.); 6. Ty (3, 5, M.P.); 7. (x)Tx (6, U.G.). (12) 1. (x)((Jx ∨ Kx) ⊃ Lx); 2. Ka; 3. (∃x)~Lx / ∴ (∃x)~Jx; 4. ~Lb (3, E.I. (b, because a already occurs)); 5. (Jb ∨ Kb) ⊃ Lb (1, U.I.); 6. ~(Jb ∨ Kb) (5, 4, M.T.); 7. ~Jb • ~Kb (6, De M.); 8. ~Jb (7, Simp.); 9. (∃x)~Jx (8, E.G.).
9. Q.8 (13–18) Construct formal proofs of validity: (13) (x)(Dx ⊃ (Hx • ~Kx)), (x)(Hx ⊃ Px), Dg / ∴ (∃x)(Px • ~Kx) (14) (x)(Hx ⊃ Gx), (∃x)(Hx • Lx) / ∴ (∃x)(Lx • Gx) (15) (x)(Ux ⊃ Wx), (x)Ux, (∃x)Zx / ∴ (∃x)(Wx • Zx) (16) (x)(Px ⊃ (Qx ⊃ Rx)), (x)(Rx ⊃ Tx), (x)Px / ∴ (x)(Qx ⊃ Tx) (17) (x)(Ix ⊃ (Px • ~Lx)), (x)(Px ⊃ Qx), Pd, (∃x)Ix / ∴ (∃x)(Qx • ~Lx) (18) (x)(Ax ⊃ (Rx ∨ Tx)), (x)Ax, (∃x)(Sx • ~Tx) / ∴ (∃x)(Sx • Rx)
Answer: (13) 1. (x)(Dx ⊃ (Hx • ~Kx)); 2. (x)(Hx ⊃ Px); 3. Dg / ∴ (∃x)(Px • ~Kx); 4. Dg ⊃ (Hg • ~Kg) (1, U.I.); 5. Hg ⊃ Pg (2, U.I.); 6. Hg • ~Kg (4, 3, M.P.); 7. Hg (6, Simp.); 8. Pg (5, 7, M.P.); 9. ~Kg • Hg (6, Comm.); 10. ~Kg (9, Simp.); 11. Pg • ~Kg (8, 10, Conj.); 12. (∃x)(Px • ~Kx) (11, E.G.). (14) 1. (x)(Hx ⊃ Gx); 2. (∃x)(Hx • Lx) / ∴ (∃x)(Lx • Gx); 3. Ha • La (2, E.I.); 4. Ha ⊃ Ga (1, U.I.); 5. Ha (3, Simp.); 6. Ga (4, 5, M.P.); 7. La • Ha (3, Comm.); 8. La (7, Simp.); 9. La • Ga (8, 6, Conj.); 10. (∃x)(Lx • Gx) (9, E.G.). (15) 1. (x)(Ux ⊃ Wx); 2. (x)Ux; 3. (∃x)Zx / ∴ (∃x)(Wx • Zx); 4. Za (3, E.I.); 5. Ua ⊃ Wa (1, U.I.); 6. Ua (2, U.I.); 7. Wa (5, 6, M.P.); 8. Wa • Za (7, 4, Conj.); 9. (∃x)(Wx • Zx) (8, E.G.). (16) 1. (x)(Px ⊃ (Qx ⊃ Rx)); 2. (x)(Rx ⊃ Tx); 3. (x)Px / ∴ (x)(Qx ⊃ Tx); 4. Py ⊃ (Qy ⊃ Ry) (1, U.I.); 5. Ry ⊃ Ty (2, U.I.); 6. Py (3, U.I.); 7. Qy ⊃ Ry (4, 6, M.P.); 8. Qy ⊃ Ty (7, 5, H.S.); 9. (x)(Qx ⊃ Tx) (8, U.G.). (17) 1. (x)(Ix ⊃ (Px • ~Lx)); 2. (x)(Px ⊃ Qx); 3. Pd; 4. (∃x)Ix / ∴ (∃x)(Qx • ~Lx); 5. Ia (4, E.I. (a is new; d already occurs)); 6. Ia ⊃ (Pa • ~La) (1, U.I.); 7. Pa ⊃ Qa (2, U.I.); 8. Pa • ~La (6, 5, M.P.); 9. Pa (8, Simp.); 10. Qa (7, 9, M.P.); 11. ~La • Pa (8, Comm.); 12. ~La (11, Simp.); 13. Qa • ~La (10, 12, Conj.); 14. (∃x)(Qx • ~Lx) (13, E.G.). (18) 1. (x)(Ax ⊃ (Rx ∨ Tx)); 2. (x)Ax; 3. (∃x)(Sx • ~Tx) / ∴ (∃x)(Sx • Rx); 4. Sa • ~Ta (3, E.I.); 5. Aa ⊃ (Ra ∨ Ta) (1, U.I.); 6. Aa (2, U.I.); 7. Ra ∨ Ta (5, 6, M.P.); 8. Ta ∨ Ra (7, Comm.); 9. ~Ta • Sa (4, Comm.); 10. ~Ta (9, Simp.); 11. Ra (8, 10, D.S.); 12. Sa (4, Simp.); 13. Sa • Ra (12, 11, Conj.); 14. (∃x)(Sx • Rx) (13, E.G.).
10. Q.8 (19–24) Construct formal proofs of validity: (19) (x)(Ax ⊃ (Bx ⊃ Fx)), (∃x)(Ax • Bx) / ∴ (∃x)Fx (20) (x)(Dx ⊃ ~Gx), Db, (∃x)(Dx • (Gx ∨ Kx)) / ∴ (∃x)Kx (21) (x)(Fx ⊃ Gx), (x)(Gx ⊃ Hx) / ∴ (x)(Fx ⊃ Hx) (22) (x)(Ax ⊃ Bx), (x)~Bx / ∴ (x)~Ax (23) (x)(Hx ⊃ Px), (x)(Px ⊃ Tx) / ∴ Hy ⊃ Ty (24) (x)(Bx ⊃ Kx), (∃x) ~Kx / ∴ ~Bt
Answer: (19) 1. (x)(Ax ⊃ (Bx ⊃ Fx)); 2. (∃x)(Ax • Bx) / ∴ (∃x)Fx; 3. Aa • Ba (2, E.I.); 4. Aa ⊃ (Ba ⊃ Fa) (1, U.I.); 5. Aa (3, Simp.); 6. Ba ⊃ Fa (4, 5, M.P.); 7. Ba • Aa (3, Comm.); 8. Ba (7, Simp.); 9. Fa (6, 8, M.P.); 10. (∃x)Fx (9, E.G.). (20) 1. (x)(Dx ⊃ ~Gx); 2. Db; 3. (∃x)(Dx • (Gx ∨ Kx)) / ∴ (∃x)Kx; 4. Da • (Ga ∨ Ka) (3, E.I. (a is new; b already occurs)); 5. Da ⊃ ~Ga (1, U.I.); 6. Da (4, Simp.); 7. ~Ga (5, 6, M.P.); 8. (Ga ∨ Ka) • Da (4, Comm.); 9. Ga ∨ Ka (8, Simp.); 10. Ka (9, 7, D.S.); 11. (∃x)Kx (10, E.G.). (21) 1. (x)(Fx ⊃ Gx); 2. (x)(Gx ⊃ Hx) / ∴ (x)(Fx ⊃ Hx); 3. Fy ⊃ Gy (1, U.I.); 4. Gy ⊃ Hy (2, U.I.); 5. Fy ⊃ Hy (3, 4, H.S.); 6. (x)(Fx ⊃ Hx) (5, U.G.). (22) 1. (x)(Ax ⊃ Bx); 2. (x)~Bx / ∴ (x)~Ax; 3. Ay ⊃ By (1, U.I.); 4. ~By (2, U.I.); 5. ~Ay (3, 4, M.T.); 6. (x)~Ax (5, U.G.). (23) 1. (x)(Hx ⊃ Px); 2. (x)(Px ⊃ Tx) / ∴ Hy ⊃ Ty; 3. Hy ⊃ Py (1, U.I.); 4. Py ⊃ Ty (2, U.I.); 5. Hy ⊃ Ty (3, 4, H.S.). (24) This argument cannot be proved, because it is invalid (a misprint or slip in the book). Counter-example: take two things, t and a. Let t be both B and K, and let a be neither. Then 'everything that is B is K' is true and 'something is not K' is true (a), but ~Bt is false. The premises allow E.I. only to a new constant, say a, which tells us nothing about t. A provable version would be (x)(Bx ⊃ Kx), ~Kt / ∴ ~Bt: 3. Bt ⊃ Kt (1, U.I.); 4. ~Bt (3, 2, M.T.).
11. Q.8 (25–30) Construct formal proofs of validity: (25) (x)(Nx ⊃ Rx), (∃x)(Qx • ~Rx) / ∴ (∃x)(Qx • ~Nx) (26) (x)(Fx ⊃ (Lx • Ox)), (x)Fx / ∴ (∃x)Ox (27) (x)(Mx ⊃ Nx), (x)(Nx ⊃ Rx) / ∴ (x)(Mx ⊃ Rx) (28) (x)(Ax ⊃ Bx), (x)(Bx ⊃ Cx), (x)(Cx ⊃ Dx) / ∴ (x)(Ax ⊃ Dx) (29) (x)(Cx ⊃ (Fx ⊃ Gx)), Cp / ∴ ~Gp ⊃ ~Fp (30) (x)(Dx ⊃ ~Gx), (∃x)(Dx • (Gx ∨ Kx)) / ∴ (∃x)Kx
Answer: (25) 1. (x)(Nx ⊃ Rx); 2. (∃x)(Qx • ~Rx) / ∴ (∃x)(Qx • ~Nx); 3. Qa • ~Ra (2, E.I.); 4. Na ⊃ Ra (1, U.I.); 5. ~Ra • Qa (3, Comm.); 6. ~Ra (5, Simp.); 7. ~Na (4, 6, M.T.); 8. Qa (3, Simp.); 9. Qa • ~Na (8, 7, Conj.); 10. (∃x)(Qx • ~Nx) (9, E.G.). (26) 1. (x)(Fx ⊃ (Lx • Ox)); 2. (x)Fx / ∴ (∃x)Ox; 3. Fy ⊃ (Ly • Oy) (1, U.I.); 4. Fy (2, U.I.); 5. Ly • Oy (3, 4, M.P.); 6. Oy • Ly (5, Comm.); 7. Oy (6, Simp.); 8. (∃x)Ox (7, E.G.). (27) 1. (x)(Mx ⊃ Nx); 2. (x)(Nx ⊃ Rx) / ∴ (x)(Mx ⊃ Rx); 3. My ⊃ Ny (1, U.I.); 4. Ny ⊃ Ry (2, U.I.); 5. My ⊃ Ry (3, 4, H.S.); 6. (x)(Mx ⊃ Rx) (5, U.G.). (28) 1. (x)(Ax ⊃ Bx); 2. (x)(Bx ⊃ Cx); 3. (x)(Cx ⊃ Dx) / ∴ (x)(Ax ⊃ Dx); 4. Ay ⊃ By (1, U.I.); 5. By ⊃ Cy (2, U.I.); 6. Cy ⊃ Dy (3, U.I.); 7. Ay ⊃ Cy (4, 5, H.S.); 8. Ay ⊃ Dy (7, 6, H.S.); 9. (x)(Ax ⊃ Dx) (8, U.G.). (29) 1. (x)(Cx ⊃ (Fx ⊃ Gx)); 2. Cp / ∴ ~Gp ⊃ ~Fp; 3. Cp ⊃ (Fp ⊃ Gp) (1, U.I.); 4. Fp ⊃ Gp (3, 2, M.P.); 5. ~Gp ⊃ ~Fp (4, Trans.). (30) 1. (x)(Dx ⊃ ~Gx); 2. (∃x)(Dx • (Gx ∨ Kx)) / ∴ (∃x)Kx; 3. Da • (Ga ∨ Ka) (2, E.I.); 4. Da ⊃ ~Ga (1, U.I.); 5. Da (3, Simp.); 6. ~Ga (4, 5, M.P.); 7. (Ga ∨ Ka) • Da (3, Comm.); 8. Ga ∨ Ka (7, Simp.); 9. Ka (8, 6, D.S.); 10. (∃x)Kx (9, E.G.).
Read the question, answer it in your head, then tap the card to check. 20 cards.
15 questions. Tap an option — you will see at once if it is right and why.
1. '(x)' is read as…
Answer: B. It is the universal quantifier.
2. 'Some cities are not crowded' is symbolised…
Answer: B. O proposition: existential with •.
3. 'No child is wicked' is symbolised…
Answer: C. E proposition: universal with ⊃ and ~.
4. Which is a propositional function?
Answer: B. x is free.
5. Which is a predicate variable?
Answer: D. φ and ψ stand for any property.
6. Singular propositions are obtained from a propositional function by…
Answer: A. Replace the variable by a constant.
7. U.G. may be applied only to…
Answer: C. What holds of an arbitrary individual holds of all.
8. In E.I. the constant must be…
Answer: C. We do not know which thing it is.
9. When both U.I. and E.I. are needed, first use…
Answer: B. Otherwise E.I. needs a new constant.
10. 'There are elephants' is…
Answer: B. Existential affirmative, one class.
11. In '(y)(Dx)' the variable x is…
Answer: C. No quantifier on x.
12. A proposition, unlike a propositional function, …
Answer: B. It is either true or false.
13. Which rule infers (∃x) φx from φa?
Answer: B. Existential Generalisation.
14. 'Few bureaucrats are honest' (book convention) is…
Answer: C. Affirmative 'few' signals O.
15. In propositional logic a proposition is…
Answer: B. Predicate logic analyses it.
Get a ✓ Verified tutor for “Predicate Logic” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Predicate Logic the fun way: match key terms, beat the 60-second lightning round and spot true or false facts. Every game uses only this lesson, so each round is real exam revision.
⭐ 0 XP⏱ About 70 minutes
Get a ✓ Verified tutor for “Predicate Logic” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Sign in free to see the answers to the textbook exercise of Predicate Logic.
Sign in to see solutionsStuck on a question? Type it, 🎤 speak it or 📷 snap a photo of it and get simple, step-by-step help with “Predicate Logic” — important questions, a quick quiz, revision notes — in English, मराठी or हिंदी.
Sign in with Google to ask the AI tutor. It's free — 20 questions a day, one TalentJR account.
Sign in to askPrefer a real teacher? TalentJR teachers take live online classes anywhere in India. Tell us what you need and our team will call you with timings and fees.