Concept

Proofs and Refutations

Proofs and Refutations: The Logic of Mathematical Discovery is a 1976 book by philosopher Imre Lakatos expounding his view of the progress of mathematics. The book is written as a series of Socratic dialogues involving a group of students who debate the proof of the Euler characteristic defined for the polyhedron. A central theme is that definitions are not carved in stone, but often have to be patched up in the light of later insights, in particular failed proofs. This gives mathematics a somewhat experimental flavour. At the end of the Introduction, Lakatos explains that his purpose is to challenge formalism in mathematics, and to show that informal mathematics grows by a logic of "proofs and refutations". The 1976 book Proofs and Refutations is based on the first three chapters of his 1961 four-chapter doctoral thesis Essays in the Logic of Mathematical Discovery. But its first chapter is Lakatos's own revision of its chapter 1 that was first published as Proofs and Refutations in four parts in 1963–4 in the British Journal for the Philosophy of Science. Many important logical ideas are explained in the book. For example, the difference between a counterexample to a lemma (a so-called 'local counterexample') and a counterexample to the specific conjecture under attack (a 'global counterexample' to the Euler characteristic, in this case) is discussed. Lakatos argues for a different kind of textbook, one that uses heuristic style. To the critics that say such a textbook would be too long, he replies: 'The answer to this pedestrian argument is: let us try.' The book includes two appendices. In the first, Lakatos gives examples of the heuristic process in mathematical discovery. In the second, he contrasts the deductivist and heuristic approaches and provides heuristic analysis of some 'proof generated' concepts, including uniform convergence, bounded variation, and the Carathéodory definition of a measurable set. The pupils in the book are named after letters of the Greek alphabet.

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 courses (5)
CS-101: Advanced information, computation, communication I
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
CS-459: Foundations of probabilistic proofs
Probabilistic proof systems (eg PCPs and IPs) have had a tremendous impact on theoretical computer science, as well as on real-world secure systems. They underlie delegation of computation protocols a
MATH-329: Continuous optimization
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
Show more
Related lectures (59)
Optimal Transport: Theory and Applications
Explores optimal transport theory, transport maps, entropy, and their practical implications in mathematical optimization.
Analyse II 2021: Course Organization
Covers the organization of the Analyse II course for 2021, including webinars, exercises, and the final exam.
Traces: Definition and Properties
Explores the definition and properties of traces in functional analysis, emphasizing uniqueness and linear operators.
Show more
Related publications (26)

X-ray chemical imaging for assessing redox microsites within soils and sediments

Meret Aeppli, Vincent Noel

Redox reactions underlie several biogeochemical processes and are typically spatiotemporally heterogeneous in soils and sediments. However, redox heterogeneity has yet to be incorporated into mainstream conceptualizations and modeling of soil biogeochemist ...
Frontiers Media Sa2024

Non-invasive neuromodulation of the right temporoparietal junction using theta-burst stimulation in functional neurological disorder

Serafeim Loukas

Background Disrupted sense of agency (SoA)-the sense of being the agent of one's own actions-has been demonstrated in patients with functional neurological disorder (FND), and a key area of the corresponding neuronal network is the right temporoparietal ju ...
London2024

Beyond undulation! Body morphology and sensing components of elongated animals and robots reveal skills to maintain competent locomotion

Laura Isabel Paez Coy

Locomotion is an essential evolutive innovation of living beings that allows them to colonize and dominate the planet. As diverse as animal morphologies are (living) and were (extinct), their locomotion modalities are also diverse. In particular, animal mo ...
EPFL2023
Show more
Related people (2)
Related concepts (1)
Mathematical proof
A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation".

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.