• Proof theory is a major branch of mathematical logic and theoretical computer science within which proofs are treated as formal mathematical objects,...
    20 KB (2,666 words) - 15:22, 15 March 2025
  • Thumbnail for Mathematical proof
    involvement of natural language, are considered in proof theory. The distinction between formal and informal proofs has led to much examination of current and...
    38 KB (4,780 words) - 23:44, 1 February 2025
  • structural proof theory is the subdiscipline of proof theory that studies proof calculi that support a notion of analytic proof, a kind of proof whose semantic...
    8 KB (1,182 words) - 22:31, 18 August 2024
  • Thumbnail for Cantor's first set theory article
    constructive and non-constructive proofs have been presented as "Cantor's proof." The popularity of presenting a non-constructive proof has led to a misconception...
    102 KB (7,563 words) - 02:18, 14 May 2025
  • computability theory overlaps with proof theory and effective descriptive set theory. Basic questions addressed by computability theory include: What...
    54 KB (6,425 words) - 20:53, 17 February 2025
  • In mathematical logic, a proof calculus or a proof system is built to prove statements. A proof system includes the components: Formal language: The set...
    4 KB (459 words) - 00:44, 20 December 2024
  • Mathematical proof Proof assistant Proof calculus Proof theory Proof (truth) De Bruijn factor Kassios, Yannis (February 20, 2009). "Formal Proof" (PDF). cs...
    5 KB (579 words) - 05:11, 29 July 2024
  • Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability theory). Research in mathematical logic...
    69 KB (8,370 words) - 19:50, 19 April 2025
  • A consistency proof is a mathematical proof that a particular theory is consistent. The early development of mathematical proof theory was driven by the...
    20 KB (2,931 words) - 16:30, 13 April 2025
  • used to arrive at answers to many of the questions posed to them. In theory, the proof by exhaustion method can be used whenever the number of cases is finite...
    7 KB (940 words) - 10:37, 29 October 2024
  • Thumbnail for Wiles's proof of Fermat's Last Theorem
    theoretic ideas from Iwasawa theory, and other 20th-century techniques which were not available to Fermat. The proof's method of identification of a...
    58 KB (5,813 words) - 08:05, 2 May 2025
  • for example, in the proof that there is no free complete lattice on three or more generators. The paradoxes of naive set theory can be explained in terms...
    9 KB (1,279 words) - 16:32, 17 November 2024
  • In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction used to show that...
    15 KB (2,223 words) - 10:12, 24 December 2024
  • Thumbnail for Proof assistant
    Tarski–Grothendieck set theory. PhoX – A proof assistant based on higher-order logic which is eXtensible. Prototype Verification System (PVS) – a proof language and...
    17 KB (1,206 words) - 18:58, 4 April 2025
  • where a proof is analytic if it does not go beyond its subject matter (Sebastik 2007). In proof theory, an analytic proof has come to mean a proof whose...
    3 KB (474 words) - 19:59, 17 December 2024
  • Thumbnail for Cantor's diagonal argument
    treated by the theory of cardinal numbers, which Cantor began. Georg Cantor published this proof in 1891,: 20–  but it was not his first proof of the uncountability...
    27 KB (2,751 words) - 02:16, 12 April 2025
  • the concept in terms of proofs and via models. The study of the syntactic consequence (of a logic) is called (its) proof theory whereas the study of (its)...
    17 KB (1,910 words) - 22:09, 28 January 2025
  • the comment that "if proof theory is about the sacred, then model theory is about the profane". The applications of model theory to algebraic and Diophantine...
    63 KB (9,065 words) - 10:26, 2 April 2025
  • elementary proof is a mathematical proof that only uses basic techniques. More specifically, the term is used in number theory to refer to proofs that make...
    5 KB (623 words) - 20:47, 17 February 2025
  • Alonzo Church Intuitionistic type theory of Per Martin-Löf Most computerized proof-writing systems use a type theory for their foundation. A common one...
    61 KB (8,234 words) - 23:11, 22 May 2025
  • its original proof Mathematical induction and a proof Proof that 0.999... equals 1 Proof that 22/7 exceeds π Proof that e is irrational Proof that π is irrational...
    6 KB (593 words) - 20:11, 5 June 2023
  • assert something currently not known in number theory. A proof would have to be a mathematical proof, assuming both the algorithm and specification are...
    7 KB (658 words) - 20:32, 14 March 2025
  • This article gives a sketch of a proof of Gödel's first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical...
    22 KB (2,988 words) - 19:37, 6 April 2025
  • logic, and in particular proof theory, a proof procedure for a given logic is a systematic method for producing proofs in some proof calculus of (provable)...
    2 KB (189 words) - 20:31, 28 June 2024
  • = 1445. Proof by counterexample is a form of constructive proof, in that an object disproving the claim is exhibited. In social choice theory, Arrow's...
    29 KB (3,915 words) - 08:17, 2 August 2024
  • theoretical computer science, and specifically proof theory and computational complexity theory, proof complexity is the field aiming to understand and...
    31 KB (3,754 words) - 09:55, 22 April 2025
  • type theory on the principles of mathematical constructivism. Constructivism requires any existence proof to contain a "witness". So, any proof of "there...
    31 KB (4,694 words) - 14:19, 17 March 2025
  • Thumbnail for Theorem
    Theorem (category Mathematical proofs)
    deducing rules. This formalization led to proof theory, which allows proving general theorems about theorems and proofs. In particular, Gödel's incompleteness...
    34 KB (4,409 words) - 00:49, 4 April 2025
  • Gentzen's consistency proof is a result of proof theory in mathematical logic, published by Gerhard Gentzen in 1936. It shows that the Peano axioms of...
    15 KB (1,993 words) - 15:35, 7 February 2025
  • theorems. The subject of logic, in particular proof theory, formalizes and studies the notion of formal proof. In some areas of epistemology and theology...
    10 KB (1,273 words) - 03:44, 1 December 2024