Basic Conjunction (AND) problems involve the logical operator ∧ (AND), which produces a true output only when both input propositions are true. These problems test your understanding of the fundamental 'both must be true' rule and its application in truth tables and real-world scenarios.

Basic Disjunction (OR) problems involve the logical operator ∨ (OR), which produces a true output when at least one of the input propositions is true. The inclusive OR (standard in logic) is true even when both are true. These problems test your understanding of the 'at least one' rule.

Basic Negation (NOT) problems involve the logical operator ¬ (NOT), which reverses the truth value of a single proposition. If p is true, ¬p is false; if p is false, ¬p is true. These problems test your understanding of logical complement and double negation.

Conditional Implication (IF-THEN) problems involve the logical operator →, representing 'if p then q'. The implication is false only when the antecedent (p) is true and the consequent (q) is false. In all other cases, it is true. These problems test understanding of conditional reasoning and the concept of sufficient conditions.

Biconditional (IFF) problems involve the logical operator ↔, representing 'if and only if' or 'p if and only if q'. The biconditional is true when p and q have the same truth value (both true or both false). It represents logical equivalence between two statements.

Exclusive OR (XOR) problems involve the logical operator ⊕, representing 'either p or q, but not both'. XOR is true when exactly one of the propositions is true, and false when both are true or both are false. These problems test understanding of exclusive alternatives.

Compound Nested Connectives problems involve logical expressions with multiple operators and parentheses (e.g., (p ∧ q) ∨ r, p → (q ∧ r), ¬(p ∧ q)). You must evaluate these expressions using truth tables or logical reasoning, respecting operator precedence and parentheses.

Truth Table Completion problems present a logical expression with a partially filled truth table. You must determine the missing truth values by evaluating the expression for each combination of input propositions. These problems test systematic evaluation and understanding of logical operators.

Converse, Inverse, and Contrapositive problems involve transforming conditional statements (if p then q) into their related forms. The contrapositive (¬q → ¬p) is logically equivalent to the original, while the converse (q → p) and inverse (¬p → ¬q) are not. These problems test understanding of logical transformations and equivalence.

Logical Equivalence problems involve determining whether two logical expressions are equivalent (have the same truth values for all input combinations). Key equivalences include De Morgan's Laws, implication equivalence (p → q ≡ ¬p ∨ q), double negation, and distributive laws.

Tautology and Contradiction problems involve identifying statements that are always true (tautologies) or always false (contradictions) regardless of the truth values of their component propositions. Examples include p ∨ ¬p (tautology) and p ∧ ¬p (contradiction).

Necessary and Sufficient Conditions problems involve identifying whether one proposition is necessary, sufficient, both, or neither for another. A sufficient condition guarantees the outcome; a necessary condition must be present for the outcome to occur.

Argument Validity problems involve determining whether a conclusion logically follows from given premises. Key valid argument forms include Modus Ponens (P→Q, P ∴ Q), Modus Tollens (P→Q, ¬Q ∴ ¬P), and Hypothetical Syllogism (P→Q, Q→R ∴ P→R). Common fallacies include Affirming the Consequent and Denying the Antecedent.

Categorical Syllogisms involve reasoning with quantifiers: 'All A are B', 'No A are B', 'Some A are B', and 'Some A are not B'. These problems test your ability to draw valid conclusions from two categorical premises using Venn diagrams or logical rules.

Logical Fallacy Identification problems present arguments containing common reasoning errors. You must identify which fallacy is being committed. Common fallacies include Ad Hominem (attacking the person), Straw Man (misrepresenting an argument), False Dilemma (presenting limited options), Circular Reasoning (assuming what you're trying to prove), and Appeal to Authority (using irrelevant authority).

Symbolic Translation problems involve converting English statements into logical symbols (∧, ∨, ¬, →, ↔). Key phrases include 'and' (∧), 'or' (∨), 'not' (¬), 'if...then' (→), 'if and only if' (↔). These problems test your ability to translate natural language into formal logic.

Counterexample Generation problems ask you to find a truth assignment to variables that makes a given logical statement false. This disproves the statement's claim of logical truth (tautology) or equivalence. These problems test your ability to find falsifying assignments.

Natural Deduction problems involve deriving conclusions from premises using valid inference rules. Common rules include Modus Ponens (P→Q, P ∴ Q), Modus Tollens (P→Q, ¬Q ∴ ¬P), Simplification (P∧Q ∴ P), Conjunction Introduction (P, Q ∴ P∧Q), and Disjunctive Syllogism (P∨Q, ¬P ∴ Q).

Knights and Knaves puzzles involve individuals who are either knights (always tell the truth) or knaves (always lie). You must deduce who is what based on their statements about themselves or others. These puzzles test logical reasoning using conditional statements and contradictions.

Unless Conditionals involve the word 'unless', which means 'if not'. The statement 'P unless Q' is logically equivalent to 'If not Q, then P' (¬Q → P) or 'P or Q' (P ∨ Q). These problems test understanding of this special conditional pattern.

Neither/Nor Statements involve the phrase 'neither p nor q', which means 'not p and not q' (¬p ∧ ¬q). These problems test understanding of joint negation and its logical equivalence to 'not (p or q)'.

Only If Distinctions problems focus on the logical meaning of 'only if' versus 'if'. 'P only if Q' means P → Q (Q is necessary for P), while 'P if Q' means Q → P (Q is sufficient for P). 'P if and only if Q' means P ↔ Q (both necessary and sufficient).

Venn Diagram Logic problems connect set operations to logical connectives. Intersection (∩) corresponds to AND (∧), Union (∪) corresponds to OR (∨), Complement (') corresponds to NOT (¬), and Subset (⊆) corresponds to Implication (→). These problems test understanding of the relationship between set theory and propositional logic.

Multi-Person Logic Puzzles involve three or more individuals making statements about themselves or others, where each is either a truth-teller (always tells truth) or liar (always lies). You must deduce the type of each person using case analysis and logical consistency.