Skip to main content
SpringerLink
Log in

Social processes and proofs of theorems and programs

  • Article
  • Published:
The Mathematical Intelligencer Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Baker, F. T. Chief programmer team management of production programming.IBM Syst. J. 11, 1 (1972), 56–73.

    Article  Google Scholar 

  2. Cohen, P. J. The independence of the continuum hypothesis. Proc. Nat. Acad. Sci., USA. Part I, vol. 50 (1963), pp. 1143–1148; Part II, vol. 51 (1964), pp. 105–110.

    Article  MathSciNet  Google Scholar 

  3. Davis, P. J. Fidelity in mathematical discourse: Is one and one really two?The Amer. Math. Monthly 79, 3 (1972), 252–263.

    Article  Google Scholar 

  4. Bateman, P., and Diamond, H. John E. Littlewood (1885- 1977): An informal obituary.The Math. Intelligencer 1, 1(1978), 28–33.

    Article  Google Scholar 

  5. Gelerenter, H., et al. The discovery of organic synthetic roots by computer. Topics in Current Chemistry 41, Springer-Ver- lag, 1973, pp. 113–150.

  6. George, J. Alan. Computer Implementation of the Finite Element Method. Ph. D. Th., Stanford U., Stanford, Calif., 1971.

    Google Scholar 

  7. Heath, Thomas L.The Thirteen Books of Euclid’s Elements. Dover, New York, 1956, pp. 204–219.

    MATH  Google Scholar 

  8. Heawood, P. J. Map colouring theorems.Quarterly J. Math., Oxford Series 24 (1890), 322–339.

    Google Scholar 

  9. Hoare, C. A. R. Quoted inSoftware Management, C. McGowan and R. McHenry, Eds.; inResearch Directions in Software Technology, M.I.T. Press, Cambridge, Mass., 1978

    Google Scholar 

  10. Jech, Thomas J.The Axiom of Choice. North-Holland Pub. Co., Amsterdam, 1973, p. 118.

    MATH  Google Scholar 

  11. Kempe, A. B. On the geographical problem of the four colors.Amer. J. Math. 2 (1879), 193–200.

    Article  MathSciNet  Google Scholar 

  12. Kolata, G. Bari. Mathematical proof: The genesis of reasonable doubt.Science 192 (1976), 989–990.

    Article  Google Scholar 

  13. Lakatos, Imre.Proofs and Refutations: The Logic of Mathematical Discovery. Cambridge University Press, England, 1976.

    Book  MATH  Google Scholar 

  14. Manin, Yu. I.A Course in Mathematical Logic. Springer-Verlag, 1977, pp. 48–51.

  15. Meyer, A. The inherent computational complexity of theories of ordered sets: A brief survey. Int. Cong. of Mathematicians, Aug. 1974.

  16. Popek, G., et al. Notes on the design of Euclid. Proc. Conf. Language Design for Reliable Software, SIGPLAN Notices (ACM)12, 3 (1977), pp. 11–18.

    Article  Google Scholar 

  17. Rabin, M. O. Probabilistic algorithms. InAlgorithms and Complexity: New Directions and Recent Results, J. F. Traub, Ed., Academic Press, New York, 1976, pp. 21–40.

    Google Scholar 

  18. Schwartz, J. On programming. Courant Rep., New York U., NewYork. 1973.

    Google Scholar 

  19. Stockmeyer, L. The complexity of decision problems in automata theory and logic. Ph. D. Th., M.I.T., Cambridge, Mass., 1974.

    Google Scholar 

  20. Ulam, S. M.Adventures of a Mathematician. Scribner’s, New York, 1976, p. 288.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Georgia Institute of Technology, 30332, Atlanta, GA

    Richard A. De Millo

  2. Princeton University, 08540, Princeton, NJ

    Richard J. Upton

  3. Yale University, 06520, New Haven, CT

    Alan J. Perlis

Authors
  1. Richard A. De Millo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard J. Upton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alan J. Perlis
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This article originally appeared in the Communications of the ACM, Vol. 22, No. 5, May 1979. We thank the Association for permitting its republication here. The work was supported in part by the U.S. Army Research Office on grants DAHC 04-74-G-0179 and DAAG 29-76-G-0038 and by the National Science Foundation on grant MCS 78-81486.

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Millo, R.A., Upton, R.J. & Perlis, A.J. Social processes and proofs of theorems and programs. The Mathematical Intelligencer 3, 31–40 (1980). https://doi.org/10.1007/BF03023394

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03023394

Keywords

Search

Navigation