Fact-checked by Grok 2 weeks ago

Strict conditional

In , the strict conditional, also known as strict implication, is a connective that relates two propositions such that the antecedent necessarily implies the consequent, meaning it is for the antecedent to be true while the consequent is false. This formulation, symbolized as p \supset q or \Box (p \to q), was developed to address limitations in classical truth-functional connectives by incorporating . First proposed by philosopher C.I. Lewis in his 1912 article "Implication and the Algebra of Logic," developed in his 1918 work A Survey of Symbolic Logic and refined in the 1932 book Symbolic Logic co-authored with C.H. Langford, the strict conditional defines p \supset q as true precisely when the conjunction p \land \neg q is self-inconsistent or impossible. Lewis proposed this to better capture intuitive notions of implication in reasoning, distinguishing it from material implication (p \to q), which is merely true whenever the antecedent is false or the consequent is true. Unlike material implication, the strict conditional avoids certain paradoxes, such as vacuously true implications from false antecedents, but it introduces its own, like deeming conditionals true when the antecedent is necessarily false. The strict conditional underpins the axiomatic systems S1 through S5 of , each varying in the strength of the necessity \Box, with S5 representing the standard system where necessity is transitive, reflexive, and symmetric. It preserves classical inference rules like modus ponens (p, p \supset q \vdash q) and exhibits properties such as transitivity (p \supset q, q \supset r \vdash p \supset r) and contraposition (p \supset q \vdash \neg q \supset \neg p), making it foundational for analyzing entailment, counterfactuals, and deontic reasoning in and formal semantics.

Definition and Semantics

Formal Definition

The strict conditional, also known as strict , is a binary connective in that captures the notion of necessary implication between propositions. It is typically denoted as p \supset q or equivalently as \Box (p \to q), where \Box is the unary necessity operator and \to is material , expressing that "necessarily, if p then q" or "p strictly implies q." This formulation was introduced by to address limitations of the material conditional by embedding necessity, ensuring the implication holds under all relevant modal constraints. The truth conditions of the strict conditional p \supset q are defined semantically in terms of possible worlds: it is true at a world w in a model M if and only if, for every world w' accessible from w via the accessibility relation R, whenever p is true at w', q is also true at w'; otherwise, it is false. This condition ensures the implication is not merely vacuously true due to a false antecedent but requires q to follow from p across all accessible scenarios. In axiomatic systems of such as S4 or S5, the strict conditional is governed by rules including ⊃-introduction—from \vdash p \to q, infer \vdash p \supset q (via the necessitation rule, as tautologies are necessarily true)—and ⊃-elimination—from \vdash p \supset q and \vdash p, infer \vdash q (leveraging the distribution axiom K: \Box(p \to q) \to (\Box p \to \Box q) and the T axiom \Box p \to p in reflexive systems). These rules, along with system-specific axioms like in S4 (\Box p \to \Box \Box p) and symmetry in S5 (\Diamond p \to \Box \Diamond p), provide a deductive for strict conditionals. originally axiomatized strict implication in his systems S1 through S5, with S5 offering the strongest on . Unlike the necessity \Box, which applies to a single and asserts its truth in all accessible worlds regardless of antecedents, the strict conditional p \supset q explicitly depends on both the antecedent p and consequent q, evaluating the of their material implication. This structure highlights its role as a refined conditional, contrasting with the non-modal material implication p \to q that it incorporates within the scope of .

Possible Worlds Interpretation

The possible worlds interpretation of strict conditionals relies on , a model-theoretic framework introduced to provide a rigorous semantics for s. In this approach, a Kripke model consists of a set W of possible worlds, representing conceivable scenarios or states of affairs; a binary accessibility relation R \subseteq W \times W, which determines which worlds are "possible" relative to a given world; and a valuation function V that assigns truth values (true or false) to atomic propositions at each world in W. The accessibility relation R is often constrained by the specific system; for instance, in the system S4, R is reflexive (every world accesses itself) and transitive (if wRv and vRu, then wRu), ensuring a structure suitable for analyzing as closure under relevant possibilities. The truth condition for a strict conditional p \supset q (equivalently, \Box (p \to q), where \Box denotes and \to is ) is evaluated at a w \in W as follows: p \supset q holds at w , for every world v \in W such that wRv, whenever V(v, p) = true, then V(v, q) = true. This means the conditional is strictly true at w precisely when the consequent q is true in all accessible worlds where the antecedent p holds, capturing the idea of necessity without exceptions in the relevant possible worlds. The formulation avoids the by relativizing truth to accessible worlds rather than the current one alone. To illustrate, consider a simple model where worlds represent linguistic or conceptual scenarios, with R universally accessible (as in S5, where R is an , effectively making all worlds mutually accessible within connected components). The proposition "All bachelors are unmarried" can be formalized as \forall x (Bachelor(x) \to Unmarried(x)), and its strict conditional form \Box (\forall x (Bachelor(x) \to Unmarried(x))) holds true at every world w because, in all accessible worlds v, the material implication is true whenever the antecedent (being a bachelor) applies, due to the analytic necessity of the concept. This example demonstrates how the semantics validates tautological necessities across possible worlds. The relation R plays a pivotal role in delineating the scope of "" for strict conditionals, with variations across modal systems affecting the evaluation. In S4, the reflexive and transitive properties ensure that necessities are stable and hereditary, suitable for epistemic or deontic interpretations where possibilities propagate consistently. In contrast, S5 employs an for R, often resulting in universal accessibility within clusters of worlds, which strengthens the strict conditional to hold relative to all logically possible alternatives, emphasizing a broader, non-local notion of necessity. These relational constraints allow the framework to model diverse notions of strictness, from conceptual to metaphysical necessities, while maintaining and for the corresponding axiomatic systems.

Historical Development

Origins with C.I. Lewis

Clarence Irving Lewis first discussed the concept of strict implication, a precursor to the modern strict conditional, in his 1912 article "Implication and the Algebra of Logic," and formalized it in his 1918 monograph A Survey of Symbolic Logic. In this work, Lewis critiqued the material implication developed in and Alfred North Whitehead's (1910), arguing that its truth-functional nature led to counterintuitive results, such as the validity of conditionals with false antecedents regardless of the consequent's truth value. Lewis proposed strict implication as an alternative that requires the consequent to be necessarily true whenever the antecedent is true, thereby capturing a sense of "genuine implication" more aligned with entailment and avoiding vacuous truths. Lewis expanded and formalized this idea in Symbolic Logic (1932), co-authored with C.H. Langford, where he presented a series of axiomatic systems—S1 through S5—built around strict implication to address the extensional limitations of material implication. These systems integrated modal notions of necessity and possibility, embedding the material conditional within a stricter modal framework to ensure entailment reflects logical necessity rather than mere truth preservation. The motivation stemmed from Lewis's desire to develop an intensional logic that better modeled deductive reasoning and intuitive inference, rejecting the purely extensional approach of Principia Mathematica in favor of one that incorporates meaning and modal structure. This foundational work by influenced the shift toward logics, paving the way for later refinements in the field.

Evolution in Modal Logic Systems

Following C. I. 's pioneering work on strict implication in the early as a enhancement to material , the strict conditional evolved through formal advancements that integrated it into broader frameworks. A pivotal refinement came from Kripke's 1963 introduction of possible worlds semantics, which offered a model-theoretic basis for interpreting the strict conditional as the of the material conditional—\square(p \to q)—across accessible worlds from a given point. This semantic approach proved completeness for key systems, including S4 (with reflexive and transitive accessibility relations) and S5 (with equivalence relations), thereby establishing the strict conditional as a cornerstone of rigorous deduction and resolving ambiguities in earlier axiomatic treatments. Within alethic modal logic, the strict conditional found a central role in articulating metaphysical necessity, where it denotes implications that obtain in every possible world, such as analytic truths in mathematics (e.g., the necessary truth of basic arithmetic statements). This integration emphasized the strict conditional's capacity to distinguish necessary connections from contingent ones, aligning it with philosophical inquiries into essence and universality. Extensions into specialized modal domains further adapted the strict conditional. In , it informed formulations of normative relations, such as O(p \to q), which expresses the to realize q whenever p holds, thereby capturing the modal strength of conditional duties beyond mere material consequence. Similarly, in epistemic logic, adaptations leveraged strict implication to model knowledge closure, as seen in principles like Kp \to Kq under known antecedents, ensuring that justified beliefs propagate necessarily within an agent's information set. Twentieth-century developments also included critical expansions, notably in , where Alan Ross Anderson and Nuel D. Belnap's 1975 work underscored the strict conditional's limitations by demonstrating its failure to guarantee antecedent-consequent relevance, a defect that permitted implausible inferences and spurred the pursuit of stricter entailment criteria.

Comparisons with Other Conditionals

Versus

The , denoted p \to q, is a truth-functional connective in that holds whenever it is not the case that p is true and q is false; it is thus true if p is false (regardless of q) or if both p and q are true. This definition, introduced in works like Russell and Whitehead's Principia Mathematica, treats implication extensionally, depending solely on the actual truth values of the propositions involved without regard to their modal or conceptual connections. In contrast, the strict conditional, denoted p \supset q or \Box (p \to q), incorporates and is true it is for p to be true while q is false, formally \Diamond (p \land \neg q) is false or equivalently \Box (p \to q). Introduced by to address perceived inadequacies in , this formulation requires a connection: the truth of the antecedent must guarantee the consequent across all possible worlds compatible with the antecedent. Thus, while the material conditional permits vacuous truths—such as any statement following from a false antecedent—the strict conditional demands that the antecedent's possibility entails the consequent's , avoiding implications without inferential . A representative example illustrates the : the "If the moon is made of green cheese, then exists on other planets" is true under material implication, as the antecedent is false in the actual world. However, it is false under strict implication, since there are possible worlds in which the moon is made of green cheese but no exists elsewhere, rendering \Diamond (p \land \neg q) true. This highlights how material implication can yield counterintuitive results from unrelated or contingently false antecedents, a feature strict implication mitigates by enforcing modal necessity. Logically, the strict conditional is stronger than its counterpart: p \supset q entails p \to q, as in all worlds implies truth in the actual world, but the reverse does not hold, since truth may lack the required universal force. For instance, a contingently true implication, like "If it is raining, then the ground is wet" in a specific , fails strict validity if scenarios exist where rain occurs without wetting the ground. This added rigor positions strict implication as a refinement suited to capturing deductive relations more intuitively.

Relation to Counterfactuals

Counterfactual conditionals, such as "If Oswald hadn't shot Kennedy, someone else would have," express hypothetical scenarios contrary to fact and are typically evaluated by considering the closest possible worlds where the antecedent holds, using a similarity metric among worlds to determine the consequent's truth. This approach, developed by David Lewis, contrasts with the strict conditional, which is defined as necessary implication, \Box (p \rightarrow q), holding true if in every possible world where p is true, q is also true. Unlike the strict conditional, counterfactuals are non-monotonic: strengthening the antecedent (e.g., adding more conditions) can alter the truth value of the conditional, as the selection of closest worlds depends on contextual factors rather than universal necessity. The strict conditional exhibits monotonicity and , properties that fail for counterfactuals due to their reliance on context-dependent nearest worlds. Monotonicity in the strict conditional means that if \Box (p \rightarrow q), then \Box ((p \land r) \rightarrow q) for any r, preserving truth when the antecedent is conjoined with additional propositions. Transitivity follows similarly: if \Box (p \rightarrow q) and \Box (q \rightarrow r), then \Box (p \rightarrow r). Counterfactuals, however, violate these: for instance, a counterfactual chain may hold stepwise based on varying similarity orderings, but the overall fails because the closest worlds for the combined antecedent differ from those for the intermediates. Philosophers have debated the suitability of strict conditionals for capturing counterfactuals, noting that strict conditionals align well with necessary truths but falter for subjunctive hypotheticals involving . proposed variably strict semantics in as a bridge, where counterfactuals are analyzed as strict conditionals relative to a contextually selected of accessible worlds, rather than all possible worlds, allowing flexibility for hypothetical reasoning. This variably strict approach addresses the limitations of pure strict conditionals, which require the antecedent to necessitate the consequent universally, making them ill-suited for scenarios with false but possible antecedents. A representative example illustrates the distinction: the sentence "If I were the King of France, I'd be bald" resists strict conditional analysis because the antecedent is impossible (there is no King of France), rendering \Box (p \rightarrow q) vacuously true regardless of the consequent, yet intuitively, it functions as a counterfactual probing a hypothetical scenario rather than a necessary implication. In contrast, counterfactual semantics evaluates such statements via similarity to the actual world, potentially yielding indeterminate or false outcomes depending on the baldness of hypothetical French monarchs in nearby worlds.

Philosophical Implications

Avoiding Paradoxes of Implication

The arise in because the , defined truth-functionally as true whenever the antecedent is false or the consequent is true, leads to counterintuitive results that fail to capture genuine inferential connections. These include cases where a contingently false antecedent implies any true consequent ( from falsity), a true antecedent implies any other true regardless of , a implies any whatsoever, and any implies a . For instance, "If pigs can fly, then is the capital of " is materially true due to the false antecedent, yet intuitively misleading as it suggests no real ; similarly, "If the Earth is flat, then snow is white" holds materially but ignores any necessary link. The strict conditional, introduced by , resolves these paradoxes by redefining in terms: p \supset q (strictly, p \strictim q) holds it is impossible for p to be true while q is false, or equivalently, necessarily (p \to q), where \to is material . This ensures the conditional is false whenever there exists an accessible in which the antecedent obtains but the consequent does not, thereby blocking vacuous truths for possible antecedents. In the example above, "If pigs can fly, then Paris is the capital of " becomes strictly false, as there exist possible worlds where pigs fly but Paris is not the capital of ; likewise, "If the Earth is flat, then snow is white" is false under strict , since flat-Earth worlds could feature non-white snow, highlighting the lack of . For impossible antecedents, such as "If $2+2=5, then pigs can fly," the strict conditional remains true, as no world realizes the antecedent at all, preserving some vacuity but avoiding the broader paradoxes tied to possible scenarios. This modal strengthening aligns strict implication more closely with natural language conditionals, which presuppose a substantive connection rather than mere truth-value correlation. Consider "If it rains, the ground gets wet": materially true in typical cases, but strictly true only if, in all relevant possible worlds where it rains, the ground necessarily wets—false, for example, under a covered surface, reflecting everyday intuitions of conditional . Lewis motivated this reform in his 1918 critique of and Alfred North Whitehead's , arguing that material 's extensional paradoxes render it inadequate for modeling actual deduction and entailment, thus necessitating a of strict implication to restore inferential rigor.

Challenges and Criticisms

One notable challenge to the strict conditional arises from cases where the consequent is necessarily true. In such scenarios, the strict conditional p \strictimp q holds vacuously for any antecedent p, regardless of its or , because there are no possible worlds in which p is true and q is false when q is necessary. For instance, the statement "If had studied , then 2 + 2 = 4" is deemed true under strict , which strikes many as intuitively odd, as the antecedent appears entirely unrelated to the necessary truth of the consequent. Although the strict conditional is logically transitive—meaning if p \strictimp q and q \strictimp r, then p \strictimp r—this property fails to align with the incremental, non-monotonic reasoning often involved in counterfactual conditionals. In hypotheticals, chaining implications can break down in ways that strict does not accommodate, such as when intermediate assumptions alter the closest possible worlds, leading to counterexamples where the overall chain does not hold intuitively. This rigidity highlights a limitation in capturing the context-sensitive nature of everyday conditional reasoning. Relevance logicians have further criticized the strict conditional for permitting irrelevance, particularly when the antecedent is . Even in modal systems, an antecedent p (i.e., \Diamond p is false) results in p \strictimp q being true for any q, as the p \to q holds in all possible worlds where p never obtains. , in his 1956 development of "rigorous implication," sought to address this by proposing a stricter connective that avoids such vacuously true implications from contradictory antecedents, arguing that true conditionals require genuine between antecedent and consequent. Philosophers like W.V.O. Quine have debated the over-strong commitment to inherent in the strict conditional, contending that it conflates purely logical necessity with broader notions, such as those involving properties or analyticity. In his 1953 analysis of involvement, Quine argued that interpreting conditionals via strict implication entangles logic with problematic intensional commitments, rendering the modality unclear and susceptible to paradoxes in quantified contexts. This critique underscores ongoing concerns about the strict conditional's foundational assumptions in .

Applications and Extensions

In Constructive Logic

In intuitionistic logic, formalized through Heyting algebra semantics, strict implication is defined as p \strictimp q \equiv \Box (p \to q), where \to denotes the intuitionistic implication and \Box represents necessity in a Kripke frame with persistent valuations. This formulation adapts the classical modal approach to a constructive setting, where validity requires not just truth preservation across accessible worlds but explicit constructions of proofs that establish the implication without relying on the law of excluded middle. Heyting algebras provide the algebraic structure, with the relative pseudocomplement serving as the intuitionistic implication, ensuring that strict implication captures deductively valid inferences in a non-classical framework. Applications of strict implication appear prominently in Heyting arithmetic (), the intuitionistic version of Peano arithmetic, where it models recursive functions and by enforcing constructive validity of inferences. In this context, strict implication ensures that proofs are effectively verifiable, aligning with the computational interpretation of logical statements via the Curry-Howard correspondence. This approach stems from Brouwer's of the 1920s, which rejected non-constructive existence proofs and emphasized mental constructions as the basis for mathematical truth, influencing the development of as a foundation for computable mathematics. Unlike in , where certain axioms can lead to near-triviality of strict implication akin to material , intuitionistic systems lack elimination, requiring strict conditionals to be supported by explicit constructive proofs rather than mere over all worlds. This difference highlights the emphasis on effective methods in , where a strict holds only if there is a uniform way to construct a proof of the consequent from any proof of the antecedent, avoiding reliance on indirect arguments. A seminal result bridging classical and constructive logics is Gödel's Dialectica interpretation (1958), which translates classical implications into quantifier-free constructive equivalents within a theory of functionals, enabling program extraction from non-constructive proofs. This interpretation maps classical arithmetic to intuitionistic HA, yielding computable witnesses that realize the translated statements and support applications in proof mining and functional programming.

In Computer Science and Theology

In , the strict conditional, defined as necessary implication in , finds application in and proof assistants such as and Agda, where it underpins modal types that model dependencies ensuring program correctness. These systems extend the Curry-Howard isomorphism to modal logics, interpreting strict implication (\Box(A \to B)) as a for modal necessities, allowing proofs to correspond to programs that verify properties like termination or resource usage in s. For instance, in modal dependent type theories implemented in Agda and , such modalities facilitate type formations that support computational irrelevance and formal verifications. In , strict conditionals play a key role in , a doctrine originated by in 1588 and revitalized by in 1974, where they articulate 's middle knowledge of counterfactuals of creaturely freedom. This middle knowledge encompasses propositions like "If agent S were placed in circumstance C, then S would freely perform action A," analyzed as true in all accessible possible worlds under divine foreknowledge, thereby reconciling with human libertarian freedom. Such strict necessities enable to actualize a world consistent with foreseen free choices without causal determination. A prominent example appears in , where the strict conditional frames moral obligation as "If commands X, then necessarily X is obligatory," positing that divine volitions ground ethical necessities across possible worlds, avoiding arbitrariness critiques by tying goodness to eternal divine nature. Recent extensions since 2010 integrate strict modals into formal verification, particularly for safety properties in computer systems, by modeling behaviors in Kripke frames of possible execution worlds to ensure invariants like non-interference or liveness hold necessarily. This approach, using modal type theories in tools akin to Coq, has been applied to secure protocol analysis and emerging AI systems against adversarial scenarios.

References

  1. [1]
    [PDF] SYMBOLIC LOGIC - HIST-Analytic
    symbolic logic tend to prefer the more comprehensive and less ... Other paradoxical theorems of. Strict Implication include 16.95, 19.85 and 19.86 above. Strict ...
  2. [2]
    [PDF] int.1 The Strict Conditional - Open Logic Project Builds
    A strict conditional is thus true (at a world) iff the corresponding material conditional is necessary. How does the strict conditional fare vis-a-vis the ...
  3. [3]
    [PDF] Implication and the Algebra of Logic
    ' We may call this kind of implication " strict " at least in the sense. that its meaning is narrower than that of the algebraic implication.<|control11|><|separator|>
  4. [4]
    [PDF] An Open Introduction to Modal Logic - Boxes and Diamonds
    This is an introductory textbook on modal logic. I use it as the main text when I teach Philosophy 579.2 (Modal Logic) at the. University of Calgary.
  5. [5]
    Symbolic Logic - Clarence Irving Lewis, Cooper Harold Langford
    Edition, unabridged ; Publisher, Century Company, 1932 ; Original from, the University of California ; Digitized, May 30, 2008 ; Length, 506 pages.
  6. [6]
    [PDF] saul a. kripke
    The semantical completeness theorem we gave for modal propositional logic can be extended to the new systems. We can introduce existence as a predicate in the ...
  7. [7]
    Modal Logic - Stanford Encyclopedia of Philosophy
    Feb 29, 2000 · Modal logic is, strictly speaking, the study of the deductive behavior of the expressions 'it is necessary that' and 'it is possible that'.
  8. [8]
    A SURVEY OF SYMBO'LIC LOGIC
    ... Symbolic Logic. Symbolic Logic and Logistic. Summary Account of their ... STRICT IMPLICATION ... 291. SECTION 1. Primitive Ideas, Primitive Propositions ...<|control11|><|separator|>
  9. [9]
    Clarence Irving Lewis - Stanford Encyclopedia of Philosophy
    Sep 25, 2007 · To explicate this notion he defined strict implication, according to which the if-then conditional \(p \fishhook q\) expressing the strict ...Brief Biography · Logic, Language, and Meaning · Empirical Knowledge and...
  10. [10]
    Symbolic Logic : Lewis, Clarence Irving and Langford, Cooper Harold
    Dec 14, 2022 · Symbolic Logic. by: Lewis, Clarence Irving and Langford, Cooper Harold. Publication date: 1932. Collection: internetarchivebooks; inlibrary ...
  11. [11]
    Lewis, Clarence Irving | Internet Encyclopedia of Philosophy
    Lewis constructed his own logical calculus based on relations in intention and strict implication, which he saw as a more adequate model of actual inference.
  12. [12]
    Modern Origins of Modal Logic - Stanford Encyclopedia of Philosophy
    Nov 16, 2010 · In the strict sense however, the term “modal logic” is reserved for the logic of the alethic modalities, as opposed for example to temporal or ...
  13. [13]
    [PDF] Semantical Analysis of Modal Logic I Normal Modal Propositional ...
    The present paper attempts to extend the results of [l], in the domain of the propositional calculus, to a class of modal systems called “normal.
  14. [14]
    Deontic Logic - Stanford Encyclopedia of Philosophy
    Feb 7, 2006 · These definitions imply that something is permissible iff (if and only if) its negation is not obligatory, impermissible iff its negation is ...
  15. [15]
    Epistemic Logic - Stanford Encyclopedia of Philosophy
    Jun 7, 2019 · Epistemic logic studies the logic of knowledge and belief, focusing on propositional knowledge and using a modal approach.
  16. [16]
    Strict implication | logic - Britannica
    Strict implication was defined as ∼♢(A·∼B), in which ♢ means “is possible” or “is not self-contradictory.” Thus A strictly implies B if it is impossible for ...
  17. [17]
    Peter Suber, "Paradoxes of Material Implication" - Earlham College
    Material implication paradoxes: a conditional is true when the antecedent is false, and when the consequent is true. For example, "If the moon is made of green ...
  18. [18]
    [PDF] lewis.pdf
    Counterfactuals are related to a kind of strict conditional based on comparative similarity of possible worlds. A counterfactual → is true at a world i if and ...
  19. [19]
    [PDF] Counterfactuals - Open Logic Project Builds
    In contrast to the strict conditional, counterfactuals may be contingent. Consider the sphere model in Figure 2.6. The φ-worlds closest to u are all ψ ...
  20. [20]
    [PDF] Conditional and Counterfactual Logic
    that draw on tools from modal logic: strict conditional analyses, similarity analyses and restrictor analyses. This section will also outline how these ...
  21. [21]
    [PDF] A Theory of Conditionals - Stalnaker (pdf) - Philosophy@HKU
    Robert Stalnaker, 'A Theory of Conditionals' from Studies in Logical Theory,. American Philosophical Quarterly, Monograph: 2 (Blackwell, 1968), pp. 98-. 112 ...
  22. [22]
    Strict conditional accounts of counterfactuals
    Jul 14, 2017 · A dynamic strict conditional account of counterfactuals as an alternative to the standard variably strict account due to Stalnaker.
  23. [23]
  24. [24]
    The Logic of Conditionals - Stanford Encyclopedia of Philosophy
    Jul 3, 2021 · The strict conditional retains Modus Ponens and a number of classic properties, such as Monotonicity, Transitivity, and Contraposition (see ...Three-Valued Conditionals · Possible Worlds Models · Probabilistic Logics
  25. [25]
    Counterfactuals - Stanford Encyclopedia of Philosophy
    Jan 18, 2019 · What notion of similarity is relevant for counterfactuals? Initially, Lewis (1973b: 92) proposed the following: Lewis's 1973 Proposal: Our ...
  26. [26]
    [1708.02143] Lewis meets Brouwer: constructive strict implication
    Aug 7, 2017 · Our particular focus is on arithmetical interpretations of the intuitionistic strict implication in terms of preservativity in extensions of ...
  27. [27]
    Lewis meets Brouwer: Constructive strict implication - ScienceDirect
    C.I. Lewis invented modern modal logic as a theory of “strict implication” ⥽ . Over the classical propositional calculus one can as well work with the unary ...
  28. [28]
    [PDF] Gödel's Functional (“Dialectica”) Interpretation - andrew.cmu.ed
    In 1958, Kurt Gödel published in the journal Dialectica an interpretation of intuitionistic arithmetic in a quantifier-free theory of functionals of finite type ...
  29. [29]
    Modalities — Agda 2.9.0 documentation
    They can be grouped into two styles: Positional modality systems and Pure modality systems. Here is the list of the modality systems in Agda: Irrelevance, ...
  30. [30]
    Normalization by evaluation for modal dependent type theory
    Oct 2, 2023 · This paper presents Mint, a modal type theory, and a modular sound and complete normalization-by-evaluation (NbE) proof for it.Missing: implication | Show results with:implication
  31. [31]
    [PDF] Towards Modal Type Theory - CMU School of Computer Science
    Oct 2, 2000 · Curry-Howard isomorphism with modal logic S4. • Possible to add possibility (3) [Pf & Davies'00]. • Interpretation of lax logic (OA = 32A).
  32. [32]
    Middle Knowledge | Internet Encyclopedia of Philosophy
    The second approach to arguing that counterfactuals of creaturely freedom cannot be true has come in the form of an assertion that Molinism leads to determinism ...
  33. [33]
    Counterpossibles and the 'terrible' divine command deity
    Jun 9, 2014 · (P1*) The DCT entails that (necessarily) for all actions A, if God commands that A be performed, then A is morally obligatory. A quick glance at ...
  34. [34]
    Divine Command Theory | Internet Encyclopedia of Philosophy
    Divine Command Theory states morality depends on God, and moral obligation is obedience to God’s commands. The right action is what God commands.Missing: strict necessity
  35. [35]
    [PDF] Security Properties through the Lens of Modal Logic - arXiv
    Sep 18, 2023 · We have introduced a framework based on modal logic which allows us to reason about the security of computer. Page 15. systems by representing ...
  36. [36]
    Toward Verified Artificial Intelligence - Communications of the ACM
    Jul 1, 2022 · In this article, we consider the challenge of verified AI from the perspective of formal methods, a field of computer science and engineering ...Missing: strict modal