Q: Which of the following statements about converse, inverse and contrapositive are correct?
(A) For “If p then q”, the converse is “If q then p”;
(B) For “If p then q”, the inverse is “If not p then not q”;
(C) For “If p then q”, the contrapositive is “If not q then not p”;
(D) An implication is always logically equivalent to its converse;
(E) An implication is logically equivalent to its contrapositive;
Choose the correct answer from the options given below:
Q: Which of the following statements about completeness and consistency in logical systems are correct?
(A) A formal logical system is complete if every logically valid sentence in its language is derivable in the system;
(B) A logical system is consistent if it does not prove both a sentence and its negation;
(C) Gödel’s incompleteness theorem, in one form, shows that sufficiently strong formal systems of arithmetic cannot be both complete and consistent;
(D) In simple propositional logic, standard proof systems are both complete and consistent;
(E) UGC NET Paper 1 typically expects only a basic idea of consistency and validity, not technical details of Gödel’s proofs;
(F) An inconsistent system can still be safely used for any logical reasoning because contradictions have no serious consequences;
Choose the correct answer from the options given below:
Q: Which of the following statements about common conditional argument forms are correct?
(A) From “If p then q” and “p” it is valid to infer “q”;
(B) From “If p then q” and “not q” it is valid to infer “not p”;
(C) From “If p then q” and “q” it is valid to infer “p”;
(D) From “If p then q” and “not p” it is valid to infer “not q”;
(E) In exam questions, A and B are examples of valid arguments and C and D are examples of common fallacious patterns;
(F) Therefore, the only correct patterns among A, B, C and D are those in A and B;
Choose the correct answer from the options given below:
Q: Which of the following statements about quantifiers in predicate logic are correct?
(A) The universal quantifier is typically read as “for all” or “for every”;
(B) The existential quantifier is typically read as “there exists at least one”;
(C) The statement “All teachers are researchers” can be symbolised as ∀x(Tx → Rx);
(D) The statement “Some teachers are researchers” can be symbolised as ∃x(Tx ∧ Rx);
(E) In predicate logic, quantifiers always range over a specified domain of discourse;
(F) Using quantifiers in logical form makes UGC NET reasoning questions impossible to understand;
Choose the correct answer from the options given below:
Q: Which of the following statements about Nyaya classification of causes are correct?
(A) Nyaya distinguishes between samavāyi (inherent), asamavāyi (non-inherent) and nimitta (efficient) causes;
(B) A samavāyi cause inheres in its effect, like threads in a cloth;
(C) A nimitta cause is an efficient or instrumental cause, like the weaver of the cloth;
(D) Nyaya holds that a single event can never have more than one type of cause simultaneously;
(E) UGC NET questions on Indian logic may ask for identification of these cause types through examples;
Choose the correct answer from the options given below:
Q: Which of the following statements about upamāna (comparison) as a pramāṇa are correct?
(A) Upamāna is recognised in Nyaya as a distinct means of valid knowledge through comparison;
(B) An example of upamāna involves learning what a “gavaya” is by comparing it to a cow after hearing a description and later seeing it;
(C) Upamāna operates without any involvement of memory or prior description;
(D) Some Indian schools reduce upamāna to other pramāṇas and do not accept it as separate;
(E) UGC NET questions may ask for identification of upamāna through such illustrative examples;
Choose the correct answer from the options given below:
Q: Select the wrong statement(s) about deductive and inductive arguments:
(A) Deductive arguments aim at certainty when they are valid and have true premises;
(B) Inductive arguments aim at probability and can be stronger or weaker;
(C) If a deductive argument’s conclusion is false, at least one premise must be false or the argument invalid;
(D) Every sound argument is inductive rather than deductive;
(E) In UGC NET reasoning, many passage-based questions require distinguishing deductive from inductive support;
Choose the correct answer from the options given below:

Comment Your Answer
Please login to comment your answer.
Sign In
Sign Up
Answers commented by others
No answers commented yet. Be the first to comment!