Q: Which of the following statements about truth-functional connectives are correct?
(A) A connective is truth-functional if the truth value of the compound depends only on the truth values of its components;
(B) βAndβ, βorβ and βifβ¦thenβ are treated as truth-functional connectives in propositional logic;
(C) The truth value of a truth-functional compound can be determined with a truth table;
(D) βBecauseβ is always treated as a truth-functional connective in basic symbolic logic;
(E) In UGC NET symbolic logic, recognising truth-functional connectives helps in constructing valid tables;
Choose the correct answer from the options given below:
Q: Which of the following statements about the meanings of conditional and biconditional statements are correct?
(A) The conditional βIf p then qβ is false only when p is true and q is false;
(B) The biconditional βp if and only if qβ is true when p and q have the same truth value;
(C) βIf and only ifβ expresses a relation of logical equivalence between two statements;
(D) In reasoning passages, βifβ and βonly ifβ always function as perfect logical symbols and never have looser everyday meanings;
(E) In UGC NET symbolic logic items, carefully distinguishing βifβ, βonly ifβ and βif and only ifβ is important for correct translation;
Choose the correct answer from the options given below:
Q: Which of the following statements about biconditional statements (βif and only ifβ) are correct?
(A) A biconditional βp if and only if qβ is true when p and q have the same truth value;
(B) The biconditional can be expressed as the conjunction of two conditionals βif p then qβ and βif q then pβ;
(C) A biconditional is false when exactly one of p and q is true;
(D) βIf and only ifβ expresses that p is sufficient for q but not necessary;
(E) In UGC NET symbolic logic, recognising biconditionals helps in equivalence transformations;
Choose the correct answer from the options given below:
Q: Select the wrong statement(s) about common deductive forms:
(A) Modus ponens has the form: If p then q; p; therefore q;
(B) Modus tollens has the form: If p then q; not q; therefore not p;
(C) Denying the antecedent (If p then q; not p; therefore not q) is a valid argument form;
(D) Affirming the consequent (If p then q; q; therefore p) is valid in all cases;
(E) In UGC NET symbolic logic, identifying invalid patterns like denying the antecedent is important;
Choose the correct answer from the options given below:
Q: Which of the following statements about translating βunlessβ in symbolic logic are correct?
(A) The English connective βunlessβ is often symbolised using βorβ and negation;
(B) βp unless qβ can be represented as βif not q then pβ;
(C) βp unless qβ is logically equivalent to βp or qβ;
(D) In UGC NET symbolic logic questions, mishandling βunlessβ can lead to incorrect formalisation;
(E) βp unless qβ is logically equivalent to βif p then qβ;
Choose the correct answer from the options given below:
Q: Which of the following statements about using truth tables in logical reasoning are correct?
(A) Truth tables systematically display all possible truth-value combinations for component statements;
(B) They can be used to test whether a given argument form is valid by checking for rows with true premises and false conclusion;
(C) A statement is a tautology if all entries in its truth table column are true;
(D) For an argument with three distinct propositional variables, a complete truth table will have eight rows;
(E) In UGC NET questions, truth tables are often used implicitly in reasoning even if not drawn explicitly in the exam booklet;
Choose the correct answer from the options given below:
Q: Which of the following statements about simple and compound propositions are correct?
(A) A simple proposition contains exactly one logical connective;
(B) Compound propositions are formed by combining simpler propositions with connectives such as βandβ, βorβ or βifβ¦thenβ;
(C) βIt is raining and it is coldβ is a compound proposition built from two simpler ones;
(D) βIt is rainingβ is a compound proposition because it expresses a complete thought;
(E) In UGC NET symbolic logic, identifying simple versus compound statements helps in symbolic translation;
Choose the correct answer from the options given below:
Q: Which of the following statements about the law of excluded middle are correct?
(A) The law of excluded middle states that for any proposition p, either p or not p is true;
(B) In classical logic, there is no third truth value between truth and falsity;
(C) Some non-classical logics question the universal applicability of the law of excluded middle;
(D) In classical two-valued logic, βp or not pβ is a contradiction;
(E) UGC NET logic questions may ask about basic logical laws like excluded middle and non-contradiction;
Choose the correct answer from the options given below:
Q: Which of the following statements about tautology, contradiction and contingency are correct?
(A) A tautology is a statement that is true in every possible valuation of its components;
(B) A contradiction is a statement that is false in every possible valuation;
(C) A contingent statement is true in all possible valuations;
(D) If an argumentβs conclusion is a tautology, the argument is automatically valid regardless of its premises;
(E) In UGC NET logic, distinguishing tautology, contradiction and contingency aids validity checking;
Choose the correct answer from the options given below:
Q: Select the wrong statement(s) about logical equivalence of compound statements:
(A) The conditional βIf p then qβ is logically equivalent to βNot p or qβ;
(B) The conjunction βp and qβ is logically equivalent to βNot (not p or not q)β;
(C) The disjunction βp or qβ is logically equivalent to βNot (not p and not q)β;
(D) The expression βp and (q or r)β is logically equivalent to β(p and q)β only;
(E) In UGC NET symbolic logic, applying such equivalences helps simplify arguments;
Choose the correct answer from the options given below:
Q: Which of the following statements about testing validity by truth tables are correct?
(A) To test an argument with a truth table, we look for rows where all premises are true;
(B) If in every row where the premises are true the conclusion is also true, the argument form is valid;
(C) If there is at least one row where all premises are true and the conclusion is false, the form is invalid;
(D) It is necessary to examine only one arbitrarily chosen row to decide validity;
(E) In UGC NET, small truth tables may be reasoned mentally without fully writing them;
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!