Notification
You need to select an answer first.
The left part of a conditional statement (If . . . then . . .) is called the sufficient condition, while the right part is called the necessary condition.
We diagram conditional statements by combining the sufficient and necessary conditions using an arrow (→).
sufficient condition → necessary condition
A necessary cause is something that is essential to produce an effect. A sufficient cause is something that is enough by itself to produce an effect.
There are four possible combinations of necessary and sufficient conditions:
The first step in diagramming a conditional is to look for the keyword that will tell you which phrase is the necessary condition and which one is the sufficient condition.
Sufficient indicators:
Necessary indicators:
You get the contrapositive of a conditional statement when you negate both the sufficient and necessary conditions and switch their positions. When converting a conditional statement to its contrapositive, its sufficient condition is negated and becomes the necessary condition, while its necessary condition is negated and becomes the sufficient condition.
The idea of a contrapositive is important because it is one of the few statements that you can validly infer from a conditional statement.
The statement If not A → B means that at least one of A and B is true. The only criterion is that at least one of these is true, which means that both can also be true at the same time.
The combination of a conditional statement and its contrapositive form the statement “If not A → B.”
“If and only if” statements, or biconditional statements, are statements composed of two conditional statements namely, a conditional statement and its converse. Biconditional statements use the left-right arrow (↔).
You can get the converse of a statement simply by switching the position of its conditions (e.g., conditional statement: A → B; converse: B → A).
From the biconditional A ↔ B, we can infer the following statements:
Inverse
The inverse of a conditional statement is simply a conditional statement where both of its conditional phrases are negated.
The inverse can also be understood as the contrapositive of the converse and vice versa.
Transitive Property
The transitive property comes in the following form:
If A → B and B → C, then A → C
“And” Conditionals
“And” Conditionals are conditional statements where one of the conditions is a compound condition (more than one element) with the conjunction “and.”
An “and” conditional comes in the following form:
If A and B, then C or (A and B) → C
The contrapositive of an “and” conditional follows the same principles of contraposition (negate both the sufficient and necessary conditions and switch their positions).
The diagrams of an “and” conditional and its contrapositive are as follows:
The same principles apply when the compound condition is on the other side of the conditional:
“Or” Conditionals
“Or” Conditionals are conditional statements where one of the conditions is a compound condition (has more than one element) with the conjunction “or.”
An “or” conditional comes in the following form:
If A or B, then C or (A or B) → C
The diagrams of an “or” conditional and its contrapositive are as follows:
The same principles apply when the compound condition is on the other side of the conditional:
An invalid inference occurs when you incorrectly infer a statement from another conditional statement. Invalid inferences are only concerned with the form of conditional statements and not their content.
Fallacy of the Converse
The fallacy of the converse is incorrectly inferring that a conditional statement is logically equivalent to its converse. You cannot infer the converse of a conditional statement from itself because they are logically different statements.
A → B is not logically equivalent to B → A
Fallacy of the Inverse
The fallacy of the inverse is very similar to the fallacy of the converse. The difference is that the fallacy of inverse is incorrectly inferring that a conditional statement is logically equivalent to its inverse.
A → B is not logically equivalent to ~A → ~B
Moreover, the fallacy of the inverse and the fallacy of the converse are ultimately the same because they are the contraposition of the other.
To better understand the relations between a conditional statement and its contrapositive, converse, and inverse, you can use the diagram below as reference:
Understanding the “some” and “some are not” qualifiers and how to represent them is important for passing the LSAT logic section.
Note: The opposite/negation of “all” is NOT “none.” The opposite/negation of “all” is “some are not.” Remember not to confuse these because a lot of people make this common mistake, which can easily be avoided by always paying close attention. These qualifiers are not reversible.
Most LSAT logic questions deal with “must be true” or “must be false” questions. These questions require that conclusions are logically inferred or properly concluded from the premises. There is no space for probability or possibility in these scenarios, everything either “must be true” or “must be false.”
Must be true
The best way to solve “must be true” questions is to diagram them and identify their parts and relations.
This type of question in the LSAT will have a total of five choices. Four of the choices in a “must be true” question can be correct, which means that they can be wrong or are only likely but not guaranteed to be true. Only one of the answers must be correct, which means that it is always true given the information provided by the question and is the correct answer.
Must be false
Likewise, “must be false” questions can also be more easily solved by diagramming them and identifying their parts and relations.
Similar to “must be true” type of questions, this type of question will have a total of five choices. Four of these can be false or cannot be directly inferred from the question, but only one must be false, and this is the correct answer.
“Most strongly supported” questions in the LSAT are questions where you have to find the answer that is most strongly supported by a given set of premises.
If the question asks for something that is most supported by the given information but does not necessarily have to be true, then it is a “most strongly supported” question.
Steps for solving “most strongly supported” questions:
Tips for solving “most strongly supported” type of questions:
Next LSAT: Week of June 12
Below are some practice questions for a review of the Formal Logic chapter.
This is an adaptive drill: The questions will get harder or easier depending on your performance. You can't go backwards or change prior answers.
Complete: 0 / 6 correct
Congratulations! You’ve finished our Formal Logic chapter. Now you should know the basics of conditional logic. In the real world, however, things are rarely so simple as cut-and-dry conditional statements. Instead, arguments are packed with assumptions. You’re moving on to the woolly world of informal logic!
Next LSAT: Week of June 12