ArticleslgStudy

science

Strict conditional

Strict conditional is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Strict conditional rather than just read about it. In short: In logic, a strict conditional (symbol: ◻ {\displaystyle \Box } , or ⥽) is a conditional governed by a modal operator, that is, a logical connective of modal logic. It is logically equivalent to the material conditional of classical logic, combined with the necessity operator from modal logic.

Key takeaways

  • Strict conditional belongs to science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Strict conditional to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Strict conditional from memory before moving on to harder problems.

Reference excerpt

In logic, a strict conditional (symbol: ◻ {\displaystyle \Box } , or ⥽) is a conditional governed by a modal operator, that is, a logical connective of modal logic. It is logically equivalent to the material conditional of classical logic, combined with the necessity operator from modal logic. For any two propositions p and q, the formula p → q says that p materially implies q while ◻ ( p → q ) {\displaystyle \Box (p\rightarrow q)} says that p strictly implies q. Strict conditionals are the result of Clarence Irving Lewis's attempt to find a conditional for logic that can adequately express indicative conditionals in natural language. They have also been used in studying Molinist theology.

Avoiding paradoxes The strict conditionals may avoid paradoxes of material implication. The following statement, for example, is not correctly formalized by material implication:

If Bill Gates graduated in medicine, then Elvis never died. This condition should clearly be false: the degree of Bill Gates has nothing to do with whether Elvis is still alive. However, the direct encoding of this formula in classical logic using material implication leads to:

Bill Gates graduated in medicine → Elvis never died. This formula is true because whenever the antecedent A is false, a formula A → B is true. Hence, this formula is not an adequate translation of the original sentence. An encoding using the strict conditional is:

◻ {\displaystyle \Box } (Bill Gates graduated in medicine → Elvis never died). In modal logic, this formula means (roughly) that, in every possible world in which Bill Gates graduated in medicine, Elvis never died. Since one can easily imagine a world where Bill Gates is a medicine graduate and Elvis is dead, this formula is false. Hence, this formula seems to be a correct translation of the original sentence.

Problems Although the strict conditional is much closer to being able to express natural language conditionals than the material conditional, it has its own problems with consequents that are necessarily true (such as 2 + 2 = 4) or antecedents that are necessarily false. The following sentence, for example, is not correctly formalized by a strict conditional:

If Bill Gates graduated in medicine, then 2 + 2 = 4. Using strict conditionals, this sentence is expressed as:

◻ {\displaystyle \Box } (Bill Gates graduated in medicine → 2 + 2 = 4) In modal logic, this formula means that, in every possible world where Bill Gates graduated in medicine, it holds that 2 + 2 = 4. Since 2 + 2 is equal to 4 in all possible worlds, this formula is true, although it does not seem that the original sentence should be. A similar situation arises with 2 + 2 = 5, which is necessarily false:

If 2 + 2 = 5, then Bill Gates graduated in medicine. Some logicians view this situation as indicating that the strict conditional is still unsatisfactory. Others have noted that the strict conditional cannot adequately express counterfactual conditionals, and that it does not satisfy certain logical properties. In particular, the strict conditional is transitive, while the counterfactual conditional is not. Some logicians, such as Paul Grice, have used conversational implicature to argue that, despite apparent difficulties, the material conditional is just fine as a translation for the natural language 'if...then...'. Others still have turned to relevance logic to supply a connection between the antecedent and consequent of provable conditionals.

Constructive logic In a constructive setting, the symmetry between ⥽ and ◻ {\displaystyle \Box } is broken, and the two connectives can be studied independently. Constructive strict implication can be used to investigate interpretability of Heyting arithmetic and to model arrows and guarded recursion in computer science.

See also Corresponding conditional Counterfactual conditional Dynamic semantics Import-Export Indicative conditional Logical consequence Material conditional

References

Bibliography Edgington, Dorothy, 2001, "Conditionals," in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic. Blackwell. For an introduction to non-classical logic as an attempt to find a better translation of the conditional, see: Priest, Graham, 2001. An Introduction to Non-Classical Logic. Cambridge Univ. Press. For an extended philosophical discussion of the issues mentioned in this article, see: Mark Sainsbury, 2001. Logical Forms. Blackwell Publishers. Jonathan Bennett, 2003. A Philosophical Guide to Conditionals. Oxford Univ. Press.

Worked examples

Example 1 — a first encounter with Strict conditional

Start with the simplest possible case. Write down what Strict conditional claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Strict conditional before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Strict conditional ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Strict conditional

In research
Strict conditional appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Strict conditional in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Strict conditional is common in secondary-school and first-year university syllabi. It links to neighbouring topics Conditionals, Formal semantics (natural language), Logical connectives, so understanding it makes those chapters shorter.
In everyday life
Look for Strict conditional outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Strict conditional” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Strict conditional in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Strict conditional means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Strict conditional out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Strict conditional in simple terms?

In logic, a strict conditional (symbol: ◻ {\displaystyle \Box } , or ⥽) is a conditional governed by a modal operator, that is, a logical connective of modal logic. It is logically equivalent to the material conditional of classical logic, combined with the necessity operator from modal logic.

Why does Strict conditional matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Strict conditional?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Strict conditional.

Tags

  • Conditionals
  • Formal semantics (natural language)
  • Logical connectives
  • Modal logic
  • Necessity

Keep exploring