Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Hypothetical syllogism
Summary
In classical logic, a hypothetical syllogism is a valid argument form, a syllogism with a conditional statement for one or both of its premises.
An example in English:
If I do not wake up, then I cannot go to work.
If I cannot go to work, then I will not get paid.
Therefore, if I do not wake up, then I will not get paid.
The term originated with Theophrastus.
A pure hypothetical syllogism is a syllogism in which both premises and conclusions are conditionals. The antecedent of one premise must match the consequent of the other for the conditional to be valid. Consequently, conditionals contain remained antecedent as antecedent and remained consequent as consequent.
If p, then q.
If q, then r.
∴ If p, then r.
A mixed hypothetical syllogism consists of one conditional statement and one statement that expresses either affirmation or denial with either the antecedent or consequence of that conditional. Therefore, such a mixed hypothetical syllogism has four possible forms, of which two are valid, while the other two are invalid(See Table). The first way to get a valid conclusion is to affirm the antecedent. A valid hypothetical syllogism either denies the consequent (modus tollens) or affirms the antecedent (modus ponens).
In propositional logic, hypothetical syllogism is the name of a valid rule of inference (often abbreviated HS and sometimes also called the chain argument, chain rule, or the principle of transitivity of implication). The rule may be stated:
where the rule is that whenever instances of "", and "" appear on lines of a proof, "" can be placed on a subsequent line.
Hypothetical syllogism is closely related and similar to disjunctive syllogism, in that it is also a type of syllogism, and also the name of a rule of inference.
The rule of hypothetical syllogism holds in classical logic, intuitionistic logic, most systems of relevance logic, and many other systems of logic. However, it does not hold in all logics, including, for example, non-monotonic logic, probabilistic logic and default logic.
Official source
About this result
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.
Related publications (2)
Related concepts (14)
Logic
Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or logical truths. It studies how conclusions follow from premises due to the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. It examines arguments expressed in natural language while formal logic uses formal language.
Modus tollens
In propositional logic, modus tollens (ˈmoʊdəs_ˈtɒlɛnz) (MT), also known as modus tollendo tollens (Latin for "method of removing by taking away") and denying the consequent, is a deductive argument form and a rule of inference. Modus tollens takes the form of "If P, then Q. Not Q. Therefore, not P." It is an application of the general truth that if a statement is true, then so is its contrapositive. The form shows that inference from P implies Q to the negation of Q implies the negation of P is a valid argument.
Logical form
In logic, logical form of a statement is a precisely-specified semantic version of that statement in a formal system. Informally, the logical form attempts to formalize a possibly ambiguous statement into a statement with a precise, unambiguous logical interpretation with respect to a formal system. In an ideal formal language, the meaning of a logical form can be determined unambiguously from syntax alone. Logical forms are semantic, not syntactic constructs; therefore, there may be more than one string that represents the same logical form in a given language.