Essentials Of The Symbolic Logic Set 5
On This Page
This set of Essentials of the Symbolic Logic Multiple Choice Questions & Answers (MCQs) focuses on Essentials Of The Symbolic Logic Set 5
Q1 | An ‘existential quantifier’ is symbolized as ,
- ‘ ∃x’
- ‘(x)’
- ‘ x’
- ( ∃x )
Q2 | ‘Everything is mortal ‘ is symbolized as …………
- ( ∃x ) ̴m x
- ( ∃x ) m x
- (x) m x
- (x) ̴m x
Q3 | ‘ Something is mortal’ is symbolized as
- (x) m x
- ( ∃x ) ̴m x
- (x) ̴m x
- ( ∃x ) m x
Q4 | ‘ Nothing is mortal’ is symbolized as
- (x) ̴m x
- ( ∃x ) m x
- ( ∃x ) ̴m x
- (x) m x
Q5 | ‘Something is not mortal’ is symbolized as
- (x) m x
- ( ∃x ) ̴m x
- ( ∃x ) m x
- (x) ̴m x
Q6 | The negation of (x) M x is logically equivalent to……………………………….
- (x) ̴m x
- ( ∃x ) m x
- ( ∃x ) ̴m x
- (x) m x
Q7 | The negation of (x) ̴M x is logically equivalent to……………………………….
- ( ∃x ) ̴m x
- (x) ̴m x
- (x) m x
- ( ∃x ) m x
Q8 | The negation of ( ∃x) ̴M x is logically equivalent to ………………….
- (x) m x
- ( ∃x ) ̴m x
- (x) ̴m x
- ( ∃x ) m x
Q9 | The negation of ( ∃x) M x is logically equivalent to ……………………….
- ( ∃x ) ̴m x
- (x) ̴m x
- ( ∃x ) m x
- (x) m x
Q10 | ‘ All fruits are ripe’ is symbolized as
- ( ∃x ) ( f x . r x )
- ( ∃x ) ( f x . ̴r x )
- (x) ( f x Ͻ r x )
- (x) ( f x Ͻ ̴r x )
Q11 | ‘ No fruits are ripe ‘ is symbolized as
- (x) ( f x Ͻ r x )
- ( ∃x ) ( f x . ̴r x )
- (x) ( f x Ͻ ̴r x )
- ( ∃x ) ( f x . r x )
Q12 | ‘Some fruits are ripe’ is symbolized as
- ( ∃x ) ( f x . ̴r x )
- ( ∃x ) ( f x . r x )
- (x) ( f x Ͻ ̴r x )
- (x) ( f x Ͻ r x )
Q13 | ‘Some fruits are not ripe’ is symbolized as
- (x) ( f x Ͻ r x )
- (x) ( f x Ͻ ̴r x )
- ( ∃x ) ( f x . r x )
- ( ∃x ) ( f x . ̴r x )
Q14 | As per modern interpretation of traditional subject-predicate propositions,A and O propositions are …………………..
- contraries
- sub-contraries
- sub alterns
- contradictories
Q15 | As per modern interpretation of traditional subject-predicate propositions,E and I propositions are ………………………………
- contradictories
- sub alterns
- sub-contraries
- contraries
Q16 | The universal quantification of a propositional function is true if and only if ……...
- at least one substitution instance is true
- all of it’s substitution instances are false
- all of it’s substitution instances are true
- it has both true and false substitution instances
Q17 | The relation between the general propositions (x) Mx and (∃x ) ̴Mx is ……………
- contrary
- contradiction
- sub contrary
- sub altern
Q18 | The relation between the general propositions (x) ̴Mx and (∃x ) Mx is ………..……
- contradiction
- sub contrary
- sub altern
- contrary
Q19 | The relation between the general propositions (x) Mx and (x) ̴Mx is ……..………
- sub contrary
- contradiction
- sub altern
- contrary
Q20 | The relation between the general propositions (∃x ) Mx and (∃x ) ̴Mx is …………
- contrary
- sub altern
- sub contrary
- contradiction
Q21 | If (x) Mx is true, then (x) ̴Mx is …………………
- true
- false
- true or false
- valid
Q22 | If (x) Mx is true, then (∃x ) Mx is …………………..
- false
- true
- valid
- true or false
Q23 | If (x) Mx is true, then (∃x ) ̴Mx is …………………………..
- true or false
- true
- false
- valid
Q24 | If (x) Mx is false, then (x) ̴Mx is …………………
- valid
- true
- true or false
- false
Q25 | If (x) Mx is false, then (∃x ) Mx is …………………..
- true or false
- false
- valid
- true