In logic, reductio ad absurdum (Latin for "reduction to absurdity"), also known as argumentum ad absurdum (Latin for "argument to absurdity") or apagogical arguments, is the form of argument that attempts to establish a claim by showing that the opposite scenario would lead to absurdity or contradiction. This argument form traces back to Ancient Greek philosophy and has been used throughout history in both formal mathematical and philosophical reasoning, as well as in debate.
The equivalent formal rule is known as negation introduction. A related mathematical proof technique is called proof by contradiction.
The "absurd" conclusion of a reductio ad absurdum argument can take a range of forms, as these examples show:
The Earth cannot be flat; otherwise, since the Earth is assumed to be finite in extent, we would find people falling off the edge.
There is no smallest positive rational number because, if there were, then it could be divided by two to get a smaller one.
The first example argues that denial of the premise would result in a ridiculous conclusion, against the evidence of our senses. The second example is a mathematical proof by contradiction (also known as an indirect proof), which argues that the denial of the premise would result in a logical contradiction (there is a "smallest" number and yet there is a number smaller than it).
Reductio ad absurdum was used throughout Greek philosophy. The earliest example of a reductio argument can be found in a satirical poem attributed to Xenophanes of Colophon (c. 570 – c. 475 BCE). Criticizing Homer's attribution of human faults to the gods, Xenophanes states that humans also believe that the gods' bodies have human form. But if horses and oxen could draw, they would draw the gods with horse and ox bodies. The gods cannot have both forms, so this is a contradiction. Therefore, the attribution of other human characteristics to the gods, such as human faults, is also false.
Greek mathematicians proved fundamental propositions using reductio ad absurdum.
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.
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.
In philosophy, an aporia (aporíā) is a conundrum or state of puzzlement. In rhetoric, it is a declaration of doubt, made for rhetorical purpose and often feigned. In philosophy, an aporia is a philosophical puzzle or a seemingly irresoluble impasse in an inquiry, often arising as a result of equally plausible yet inconsistent premises (i.e. a paradox). It can also denote the state of being perplexed, or at a loss, at such a puzzle or impasse.
Buddhapālita (; , fl. 5th-6th centuries CE) was an Indian Mahayana Buddhist commentator on the works of Nagarjuna and Aryadeva. His Mūlamadhyamaka-vṛtti is an influential commentary to the Mūlamadhyamakakarikā. Buddhapālita's commentarial approach works was criticised by his contemporary Bhāviveka, and then defended by the later Candrakīrti (c. 600–650). Later Tibetan scholasticism (11th century onwards) would characterize the two approaches as the prasaṅgika (Buddhapālita-Candrakīrti) and svatantrika (Bhāviveka's) schools of Madhyamaka philosophy (but these terms do not appear in Indian Sanskrit 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
This course introduces students to continuous, nonlinear optimization. We study the theory of optimization with continuous variables (with full proofs), and we analyze and implement important algorith
The course is about the derivation, theoretical analysis and implementation of the finite element method for the numerical approximation of partial differential equations in one and two space dimens
We study the regularity of the regular and of the singular set of the obstacle problem in any dimension. Our approach is related to the epiperimetric inequality of Weiss (Invent Math 138:23-50, Wei99a), which works at regular points and provides an alterna ...
The controllability of the linearized KdV equation with right Neumann control is studied in the pioneering work of Rosier [25]. However, the proof is by contradiction arguments and the value of the observability constant remains unknown, though rich mathem ...
2019
We study the regularity of the regular and of the singular set of the obstacle problem in any dimension. Our approach is related to the epiperimetric inequality of Weiss (Invent Math 138:23–50, Wei99a), which works at regular points and provides an alterna ...