The death of proof? Semi-rigorous mathematics? You've got to be kidding!

Andrews, George E.
September 1994
Mathematical Intelligencer;Fall94, Vol. 16 Issue 4, p16
Academic Journal
Presents a critique of Doron Zeilberger's article `Theorems for a Price: Tomorrow's Semi-Rigorous Mathematical Culture' about the paradigm shift in mathematical proving. Nature of rigorous mathematics; Computer application in proof theory; Proving of identities.


Related Articles

  • Does every proposition have a unique contradictory? Cresswell, M. J. // Analysis;Apr2008, Vol. 68 Issue 298, p112 

    An essay is presented addressing why propositions that have only one unique contradictory and are logically equivalent must be identical propositions. The author utilizes logical and modal illustrations to argue his point. Also discussed is the possible trivialisation of logical inference and...

  • Frege’s Begriffsschrift as a lingua characteristica. Korte, Tapio // Synthese;May2010, Vol. 174 Issue 2, p283 

    In this paper I suggest an answer to the question of what Frege means when he says that his logical system, the Begriffsschrift, is like the language Leibniz sketched, a lingua characteristica, and not merely a logical calculus. According to the nineteenth century studies, Leibniz’s...

  • Mathematical Form in the World*. SMITH, DAVID WOODRUFF // Philosophia Mathematica;Jan2002, Vol. 10 Issue 2, p102 

    This essay explores an ideal notion of form (mathematical structure) that embraces logical, phenomenological, and ontological form. Husserl envisioned a correlation among forms of expression, thought, meaning, and object—positing ideal forms on all these levels. The most puzzling formal...

  • CORRIGENDUM.  // Review of Symbolic Logic;Sep2009, Vol. 2 Issue 3, p591 

    A correction to the article "Intransitivity and Vagueness" by Joseph Y. Halpern that was published in a previous issue is presented.

  • Editorial: Relational approaches to knowledge representation and learning. Beierle, Christoph; Kern-Isberner, Gabriele // Logic Journal of the IGPL;Oct2012, Vol. 20 Issue 5, p771 

    An introduction is presented in which the editor discusses various articles within the issue on topics including logic, KReator system and entropy.

  • Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut... Carbone, A.; Semmes, S. // Bulletin (New Series) of the American Mathematical Society;Apr1997, Vol. 34 Issue 2, p131 

    Introduces the combinatorics and complexity of cut elimination in mathematical logic. Explanation of sequent calculus; Analysis of cut elimination; Role of cut elimination in the mathematical proofs; Remarks about the subformula property; Introduction of the Craig interpolation, Herbrand's and...

  • CRACK THE CODE. Pickover, Clifford A. // Odyssey;Nov2004, Vol. 13 Issue 8, p41 

    Presents a brain strain for the readers related to a logical reasoning.

  • A VERIFICATION OF LANCHESTER'S LAW. Engel, J.H. // Journal of the Operations Research Society of America;May54, Vol. 2 Issue 2, p163 

    The validity of Lanchester's equations is demonstrated in an actual combat situation where US forces captured the island of Iwo Jima. The equations tested are dM/dt=P(t)-AN, and dN/dt=-BM, with t the time elapsed since the beginning of the engagement, measured in days; M(t), and N(t) the...

  • Extending States on Finite Concrete Logics. De Simone, Anna; Navara, Mirko; Pták, Pavel // International Journal of Theoretical Physics;Aug2007, Vol. 46 Issue 8, p2046 

    In this note we collect several observations on state extensions. They may be instrumental to anyone who pursues the theory of quantum logics. In particular, we find out when extensions (resp. signed extensions) exist in the “concrete” concrete logic of all even-element subsets of an...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics