Counterfactual conditionals (also subjunctive or X-marked) are conditional sentences which discuss what would have been true under different circumstances, e.g. "If Peter believed in ghosts, he would be afraid to be here." Counterfactuals are contrasted with indicatives, which are generally restricted to discussing open possibilities. Counterfactuals are characterized grammatically by their use of fake tense morphology, which some languages use in combination with other kinds of morphology including aspect and mood.
Counterfactuals are one of the most studied phenomena in philosophical logic, formal semantics, and philosophy of language. They were first discussed as a problem for the material conditional analysis of conditionals, which treats them all as trivially true. Starting in the 1960s, philosophers and linguists developed the now-classic possible world approach, in which a counterfactual's truth hinges on its consequent holding at certain possible worlds where its antecedent holds. More recent formal analyses have treated them using tools such as causal models and dynamic semantics. Other research has addressed their metaphysical, psychological, and grammatical underpinnings, while applying some of the resultant insights to fields including history, marketing, and epidemiology.
The difference between indicative and counterfactual conditionals can be illustrated by the following English minimal pair:
Indicative conditional: If Sally owns a donkey, then she beats it.
Simple past counterfactual: If Sally owned a donkey, she would beat it.
These conditionals differ in both form and meaning. The indicative conditional uses the present tense forms "owns" and "beats" and therefore conveys that the speaker is agnostic about whether Sally in fact owns a donkey. The counterfactual example uses the fake tense form "owned" in the "if" clause and the past-inflected modal "would" in the "then" clause. As a result, it conveys that Sally does not in fact own a donkey.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
L'étudiant acquiert une initiation théorique à la méthode des éléments finis qui constitue la technique la plus courante pour la résolution de problèmes elliptiques en mécanique. Il apprend à applique
The course provides an introduction to econometrics. The objective is to learn how to make valid (i.e., causal) inference from economic and social data. It explains the main estimators and present met
In natural languages, an indicative conditional is a conditional sentence such as "If Leona is at home, she isn't in Paris", whose grammatical form restricts it to discussing what could be true. Indicatives are typically defined in opposition to counterfactual conditionals, which have extra grammatical marking which allows them to discuss eventualities which are no longer possible. Indicatives are a major topic of research in philosophy of language, philosophical logic, and linguistics.
The material conditional (also known as material implication) is an operation commonly used in logic. When the conditional symbol is interpreted as material implication, a formula is true unless is true and is false. Material implication can also be characterized inferentially by modus ponens, modus tollens, conditional proof, and classical reductio ad absurdum. Material implication is used in all the basic systems of classical logic as well as some nonclassical logics.
In logic, a strict conditional (symbol: , 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 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.
Mood inference with mobile sensing data has been studied in ubicomp literature over the last decade. This inference enables context-aware and personalized user experiences in general mobile apps and valuable feedback and interventions in mobile health apps ...
ASSOC COMPUTING MACHINERY2022
, ,
Models trained with counterfactually augmented data learn representations of the causal structure of tasks, enabling robust generalization. However, high-quality counterfactual data is scarce for most tasks and not easily generated at scale. When crowdsour ...
Assoc Computational Linguistics-Acl2023
, ,
Diffusion models generating images conditionally on text, such as Dall-E 2 [51] and Stable Diffusion[53], have recently made a splash far beyond the computer vision com- munity. Here, we tackle the related problem of generating point clouds, both unconditi ...
2023
Demonstrates adding a variable to track levels in a program.
Covers two quizzes on nested loops and conditionals with different outputs.
Covers the compilation of statement sequences, control structures, boolean representation, and comparisons in WebAssembly code generation.