Symbolic Logic | Set 4
1. If x) Mx is true, then (∃ x) Mx is …………………
2. If x) Mx is true, then (∃ x ) Mx is …………………
3. If x) Mx is true, then x) Mx is …………………
4. If x) Mx is false, then x) Mx is …………………
5. If x) Mx is false, then (∃ x) Mx is …………………
6. If x) Mx is false, then (∃ x ) Mx is …………………
7. If (∃ x ) Mx is true, then x) Mx is …………………
8. If (∃ x ) Mx is true, then x) Mx is …………………
9. If (∃ x ) Mx is true, then (∃ x ) Mx is …………………
10. If (∃ x ) Mx is false, then x) Mx is …………………
11. If (∃ x ) Mx is false, then x) Mx is …………………
12. If (∃ x ) Mx is false, then (∃ x ) Mx is …………………
13. If (∃ x ) Mx is true , then x) Mx is …………………
14. If (∃ x ) Mx is true , then x) Mx is …………………
15. If (∃ x ) Mx is true, then (∃ x ) Mx is …………………
16. If (∃ x ) Mx is false, then x) Mx is …………………
17. If (∃ x ) Mx is false, then x) Mx is …………………
18. If (∃ x ) Mx is false, then (∃ x ) Mx is …………………
19. If (x) ( H x Ͻ Mx ) is true, then (∃ x ) x . Mx ) is …………………
20. If (x) ( H x Ͻ Mx ) is false , then (∃ x ) x . Mx ) is …………………………
21. If (x) ( H x Ͻ Mx) is true, then (∃ x ) x . Mx ) is……………………….
22. If (x) ( H x Ͻ Mx ) is false , then (∃ x ) x . Mx ) is ……………………….
23. If (∃ x ) ( H x . Mx ) is true, then (x) ( H x Ͻ Mx ) is …………………
24. If (∃ x ) ( H x . Mx ) is false , then (x) ( H x Ͻ Mx ) is …………………
25. If (∃ x ) x . Mx ) is true, then (x) ( H x Ͻ Mx ) is ………………..
26. If (∃ x ) x . Mx ) is false , then (x) ( H x Ͻ Mx ) is ………………..
27. The ____________of an argument is that proposition which is affirmed on the basis of
other propositions of the argument.
28. Every argument has a _________, in the analysis of which the terms ‘Premise’ and
‘conclusion’ are usually employed.
29. Deductive argument involve the claim that its premises provide __________ grounds for
the truth of their conclusion
30. Inductive arguments involve the claim only that their premises provide __________
grounds for their conclusions.
31. Arguments, however are not properly characterized as being either true or false but
valid and _________.
32. Conjunctions are truth functionally ____________ statements.
33. The truth value of _______ statement is true.
34. The truth value of the ____________ of two statements is completely determined by
the truth value of its conjuncts.
35. The statement Roses are red and leafs are green is a _________________
a) Conjunction b) Negation c) Disjunction d) Conditional
36. When two statements are combined disjunctively by inserting the word ‘or’ between
37. Any conditional with a true antecedent and a false consequent must ____________
38. An invalid argument form is one that has at least one substitution_________ with true
premises and a false conclusion
39. Raju is either sick or lazy is an example for
40. A ____________proposition do not contain any other proposition as its constituent
41. A _______________proposition is one which contains other proposition as it’s
Component
42. The symbolization for disjunction is __________
43. Validity of a deductive argument depends upon the ________ of the argument.
44. An argument is sound when it is factually correct and is __________
45. In a conditional, the component statement that follows “ then ” is called ……………
46. Terms are constituents of logical ____________
47. The symbol used for weak disjunction is
48. The symbol used for Biconditional is
49. The symbolization for “it is not the case that the antecedent is true and the consequent
is false” is _________________
50. The statement form ~( p . ~q ) is equivalent to which of the following
51. Proposition is particular if the subject refers to only _______of the class
52. A proposition ___________term, if it refers to all members of the class designated by
the term
53. An ________ proposition is said to distribute both subject and predicate terms
54. A universal or particular affirmative proposition, do not distribute their_________term.
55. A valid standard form categorical syllogism must contain exactly __________terms, each
of which is used in the same sense throughout the argument.
56. The___________ of the class of all chairs is the class of all things that are not chairs.
57. Which of the following is the obverse of the proposition of the A proposition’ All S is P ‘
58. A statement form that has only false substitution instance is said to be
59. The statement form ~(p.q) is logically equivalent to
60. The statement form p ↄ q is logically equivalent to
61. [(p . q) ↄ r] is logically equivalent to which of the following
62. The compound proposition in which the word ‘and’ is used to connect simple
statements
63. In the conditional , the component statement that follows ‘then’ is called
64. The weak implication symbolized by Ɔ is called a
65. Universal quantifier is symbolized as
66. There is atleast one x such that x is mortal can be symbolized as
67. _____________ is the process of obtaining a proposition from a propositional function
by substituting a constant for the variable.
68. An error in reasoning is called _________
69. Obversion is a valid __________inference, when applied to any standard form
categorical proposition.
70. The premise of the immediate inference by obversion is referred to as
71. A deductive argument in which conclusion is inferred from two premises is called
72. The term that occurs as the predicate of the conclusion is
73. The form of a syllogism may be completely described by stating its mood and________
74. The term that occurs as the subject of the conclusion is called
75. In Symbolic logic parentheses, braces , brackets are used as __________
marks
76. Name the rule of inference
( p . q ) ≡ ( q . p )
77. If (∃x ) ~ Mx is true , then (x) Mx is _____________
78. If (x) ( H x Ͻ Mx ) is true, then (∃x ) ( H x . ~Mx ) is ___________
79. Bi-conditional statement is also called _____________
80. The negation of p v q is symbolised as
81. Raju and Manu will both not win is symbolised as
82. By using symbols, we can ___________the validity of an argument quickly and
accurately
83. A statement can be replaced only by a statement logically __________to it .
84. By _______________, the left-hand conjunct can be switched over to the right-hand
85. The negation of the conjunction of two statements is logically equivalent to __________
of their negation.
86. Name the rule of replacement
(P ≡ q)≡ [(p.q) v (~p.~q)]
87. If (∃x ) Mx is true, then (∃x ) ~Mx is ____________
88. Conjunction, Disjunction,Implication and biconditional are called Truth ________
connectives
89. A general proposition is formed from a propositional function by placing either
a universal or an existential __________before it.