1. The two types of statements dealt within propositional logic are ……………………
Correct : D. simple and compound statements.
2. In a conditional, the component statement that follows the “if” is called ……………
Correct : B. the “antecedent”
3. In a conditional, the component statement that follows the “then” is called ……….
Correct : B. the “consequent”
4. The two component statements of conjunction are called……………………………..
Correct : C. “conjuncts”
5. The two component statements of disjunction are called
……………………………….
Correct : C. “disjuncts”
6. When two statements are combined by using the phrase “if and only if”, the
resulting compound statement is called …………………………………………..
Correct : B. bi-conditional statement
7. Bi-conditional statement is also called ………………….
Correct : D. material equivalence
8. Conditional statement is also called………………………………….
Correct : A. implication
9. The phrase “if and only if” is used to
express……………………………………………………….
Correct : B. both sufficient and necessary condition
10. A compound proposition whose truth-value is completely determined by the
truth-values of it’s component statements is called …………………….
Correct : D. truth-functional
11. ………………………….. Symbol is used for conjunction
Correct : A. The dot “.”
12. ………………………….. Symbol is used for weak disjunction
Correct : A. the vel ”v”
13. ………………………….. Symbol is used for negation
Correct : C. the tilde “ ~ ”
14. …………………………..Symbol is used for bi –conditional
Correct : D. “ ≡ “
15. A conjunction is true if and only if ……………………………………….
Correct : B. both of it’s conjuncts are true
16. Inclusive or weak disjunction is false only in case
……………………………………………….
Correct : A. both of it’s disjuncts are false
17. The dot “ . ”symbol is……………………………………..
Correct : D. a truth-functional connective
18. The curl “ “ is ……………………………………………………..
Correct : D. a truth-functional operator
19. Gopal is either intelligent or hard working’ is an example for
…………………………
Correct : C. inclusive or weak disjunction
20. ‘Today is Thursday or Saturday’ is an example for………………………………..
Correct : B. exclusive disjunction
21. ’If you study well, then you will pass the examination’ is an example for ……………
Correct : A. implication
22. A conditional statement asserts that in any case in which it’s antecedent is true,
it’s consequent is ……………………………
Correct : D. true also
23. or a conditional to be true the conjunction “ p. q “ must be ……………….
Correct : C. false
24. No real connection between antecedent and consequent is suggested by …………
Correct : B. material implication
25. “it is not the case that the antecedent is true and the consequent is false” is
symbolized as……………………………………….
Correct : A. p . q )
26. ‘ q if p ‘ is symbolized as……………………………….
Correct : D. ’ p Ͻ q ‘
27. “p only if q “ is symbolized as ……………………….
Correct : B. ‘ p Ͻ q ‘
28. ’ The conjunction of p with the disjunction of q with r’, is symbolized as …….
Correct : C. p . ( q v r )
29. ‘The disjunction whose first disjunct is the conjunction of p and q and whose
second disjunct is r ‘ is symbolized as ………………………..
Correct : D. ( p . q ) v r
30. The negaton of A V B is symbolized as ………………
Correct : B. ( A V B )
31. ‘ A and B will not both be selected ’ is symbolized as ………………………..
Correct : A. ( A . B )
32. Ramesh and Dinesh will both not be elected.
Correct : B. A . B
33. An argument can be proved invalid by constructing another argument of the
same form with …………………….
Correct : B. true premises and false conclusion
34. …………………………… can be defined as an array of symbols containing statement variables but no statements, such that when statements are substituted for statement variables- the same statement being substituted for the same
statement variable throughout – the result is an argument
Correct : C. An argument form
35. Any argument that results from the substitution of statements for statement
variables in an argument form is called ………………………………
Correct : D. a “ substitution instance” of that argument form
36. In case an argument is produced by substituting a different simple statement for
each different statement variable in an argument form, that argument form is called ……………………
Correct : A. the “specific form” of that argument
37. If the specific form of a given argument has any substitution instance whose
premises are true and whose conclusion is false, then the given argument is.
Correct : B. invalid
38. Refutation by logical analogy is based on the fact that any argument whose
specific form is an invalid argument form is ………………………..
Correct : C. an invalid argument.
39. Fallacy of Affirming the Consequent- is symbolized as
Correct : C. P Ͻ q
40. Fallacy of Denyingthe Antecedent- is symbolized as
Correct : C. P Ͻ q
41. ’statement form from which the statement results by substituting a different
simple statement for each different statement variable’ is called ……………………..
Correct : D. the specific form of a given statement
42. A statement form that has only true substitution instances is called
……………………
Correct : A. a “ tautologous statement form “ or a “ tautology”
43. Statement forms that have both true and false statements among their
substitution instances are called ……………………………………………..
Correct : B. contingent statement forms
44. Two statements are ………………… when their material equivalence is a tautology
Correct : C. logically equivalent
45. …………………. statements have the same meaning and may be substituted for one
another
Correct : B. Logically equivalent
46. p v q) is logically equivalent to ………………………………..
Correct : A. p . q
47. . p . q) is logically equivalent to …………………………………..
Correct : C. p v q
48. An argument form is valid if and only if it’s expression in the form of a conditional
statement is ……………
Correct : C. a tautology
49. “If a statement is true, then it is implied by any statement whatever” is
symbolized as
Correct : B. p Ͻ (q Ͻ p)
50. “ If a statement is false, then it implies any statement whatever”
Correct : A. p Ͻ (P Ͻ q)
51. The rule of Hypothetical Syllogism ( H.S) is symbolized as
Correct : B. P Ͻ q
52. The rule of Absorption (Abs) is symbolized as
Correct : B. P Ͻ q
53. The rule of Simplification (Simp) is symbolized as
Correct : B. P . q
54. The rule of Addition is symbolized as
Correct : C. P
55. The rule of Conjunction (Conj) is symbolized as
Correct : D. P
56. Name the rule of inference
P . Q) ≡ P V Q)
Correct : C. De Morgan’s Theorem De M )
57. Name the rule of inference
p v q ) ≡ q v p )
Correct : A. Commutation ( Com )-
58. Name the rule of inference
[ p v q v r ) ] ≡ [ p v q ) v r ]
Correct : C. Association (Assoc )-
59. Name the rule of inference
[ p . q v r ) ] ≡ [ p . q ) v p. r) ]
Correct : B. Distribution (Dist )
60. Name the rule of inference
P ≡ p
Correct : C. Double Negation ( D .N )-
61. Name the rule of inference
( P Ͻ q ) ≡ Q Ͻ P )
Correct : C. Transposition (Trans )-
62. Name the rule of inference
( P Ͻ q ) ≡ P v q )
Correct : A. Material Implication (Impl)-
63. Name the rule of inference
P ≡ q ) ≡ [ p Ͻ q ) . ( q Ͻ p ) ]
Correct : D. Material Equivalence ( Equiv )-
64. Name the rule of inference
[ (P . Q ) Ͻ r ) ] ≡ [ p Ͻ ( q Ͻ r ) ]
Correct : D. Exportation ( E x p)-
65. Name the rule of inference
P V Q) ≡ P . Q )
Correct : B. De Morgan’s Theorems De M )
66. Name the rule of inference
p . q ) ≡ q . p )
Correct : A. Commutation ( Com )-
67. Name the rule of inference
[ p . q . r ) ] ≡ [ p . q ) . r ]
Correct : C. Association (Assoc )-
68. Name the rule of inference
P ≡ q ) ≡ [ p . q ) v P . Q ) ]
Correct : B. Material Equivalence ( Equiv )-
69. Name the rule of inference
p ≡ p . p )
Correct : C. Tautology ( Taut )-
70. The process of obtaining a proposition from a propositional function by
substituting a constant for a variable is called …………………………………
Correct : C. instantiation
71. General propositions can be regarded as resulting from propositional functions
by a process called
Correct : D. quantification
72. The phrase ‘Given any x’ is called …………………………………….
Correct : B. a universal quantifier
73. Universal quantifier is symbolized as …………
Correct : A. ‘ x)’
74. The phrase ‘ there is at least one x such that’ is called ………………………………
Correct : C. an existential quantifier
75. An ‘existential quantifier’ is symbolized as ,
Correct : D. ( ∃x )
76. ‘Everything is mortal ‘ is symbolized as …………
Correct : C. (x) M x
77. ‘ Something is mortal’ is symbolized as
Correct : D. ( ∃x ) M x
78. ‘ Nothing is mortal’ is symbolized as
Correct : A. (x) M x
79. ‘Something is not mortal’ is symbolized as
Correct : B. ( ∃x ) M x
80. The negation of x) M x is logically equivalent to……………………………….
Correct : C. ( ∃x ) M x
81. The negation of (x) M x is logically equivalent to……………………………….
Correct : D. ( ∃x ) M x
82. The negation of ( ∃x) M x is logically equivalent to ………………….
Correct : A. (x) M x
83. The negation of ( ∃x) M x is logically equivalent to ……………………….
Correct : B. (x) M x
84. ‘ All fruits are ripe’ is symbolized as
Correct : C. (x) ( F x Ͻ R x )
85. ‘ No fruits are ripe ‘ is symbolized as
Correct : C. (x) ( F x Ͻ R x )
86. ‘Some fruits are ripe’ is symbolized as
Correct : B. ( ∃x ) ( F x . R x )
87. ‘Some fruits are not ripe’ is symbolized as
Correct : D. ( ∃x ) ( F x . R x )
88. As per modern interpretation of traditional subject-predicate propositions,
A and O propositions are …………………..
Correct : D. contradictories
89. As per modern interpretation of traditional subject-predicate propositions,
E and I propositions are ………………………………
Correct : A. Contradictories
90. The universal quantification of a propositional function is true if and only if ……...
Correct : C. all of it’s substitution instances are true
91. The relation between the general propositions (x) Mx and (∃x ) Mx is ……………
Correct : B. contradiction
92. The relation between the general propositions x) Mx and (∃x ) Mx is ………..……
Correct : A. contradiction
93. The relation between the general propositions x) Mx and x) Mx is ……..………
Correct : D. contrary
94. The relation between the general propositions (∃x ) Mx and (∃x ) Mx is …………
Correct : C. sub contrary
95. If x) Mx is true, then x) Mx is …………………
Correct : B. false
96. If (x) Mx is true, then (∃x ) Mx is …………………..
Correct : B. true
97. If (x) Mx is true, then (∃x ) Mx is …………………………..
Correct : C. false
98. If x) Mx is false, then x) Mx is …………………
Correct : C. true or false
99. If (x) Mx is false, then (∃x ) Mx is …………………..
Correct : A. true or false
100. If (x) Mx is false, then (∃x ) Mx is …………………………..