About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 88. Chapters: Mathematical induction, Presburger arithmetic, Godel's completeness theorem, Soundness, Natural deduction, Original proof of Godel's completeness theorem, Consistency, Godel's incompleteness theorems, Curry-Howard correspondence, Mathematical fallacy, Reverse mathematics, Sequent calculus, Large countable ordinal, Hilbert system, Deduction theorem, Fast-growing hierarchy, Ordinal notation, Ω-consistent theory, Decidability, Undecidable problem, Hilbert's program, Metalanguage, Extension by definitions, Ordinal analysis, Veblen function, Dialectica interpretation, Godel-Gentzen negative translation, Pure type system, Herbrand's theorem, Cut-elimination theorem, Bounded quantifier, Slow-growing hierarchy, Gentzen's consistency proof, Elementary function arithmetic, Realizability, Conservative extension, Formal proof, Setoid, Lambda-mu calculus, Primitive recursive functional, Hardy hierarchy, Epsilon calculus, Peano-Russell notation, Independence, Analytic proof, Structural proof theory, Turnstile, Judgment, Proof calculus, Friedman translation, Self-verifying theories, Structural rule, Bachmann-Howard ordinal, Proof-theoretic semantics, Provability logic, Disjunction and existence properties, Conservativity theorem, Paraconsistent mathematics, Deep inference, Psi0(Omega omega), Takeuti's conjecture, Deductive system, Geometry of interaction, Tolerant sequence, Weak interpretability, Proof procedure, Decidable sublanguages of set theory, Feferman-Schutte ordinal, Church-Kleene ordinal, Proof mining, Completeness of atomic initial sequents, Proof net, VIPER microprocessor, NuPRL, Reverse reconstruction.
