Skip to main content

Abstract

The chapter starts with quick glimpses of some major steps in the history of the formalization of mathematical reasoning: Aristotle’s syllogisms, Leibniz’s program, Boole’s algebra of propositions, Frege’s Begriffsschrift, Peano’s axiomatization of arithmetic, Whitehead and Russell’s attempt at formalizing the whole corpus of mathematics, Descartes’ reduction of geometry to algebra, Cauchy’s formalization of continuity, Dedekind’s definition of the system of real numbers, Cantor’s transfinite set theory, Russel’s paradox, Zermelo–Fraenkel’s axiomatization of set theory, Hilbert’s program, Gödel’s negative results, etc.

Proof verifiers are then introduced. It is argued that to ease interaction with humans, they must be equipped with some degree of mathematical intelligence, in the form of deduction mechanisms. The main such mechanisms implemented in the proof-verification system Ref, developed by the authors, are quickly reviewed, as well as the most important ingredients of its formalism. Among them, set theory and ‘theory’-based reasoning play a preeminent role.

Finally, a survey of the major sequence of definitions and proofs considered in the text is provided, leading from the barest rudiments of set theory to the formulation of a special form of the Cauchy integral theorem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    By proper order, we mean strict and total order.

  2. 2.

    Conciser, but less classical, characterizations of Cauchy sequences and of equivalence between them will be seen in Sect. 4.1.4.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Domenico Cantone or Eugenio G. Omodeo .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Schwartz, J.T., Cantone, D., Omodeo, E.G. (2011). Introduction. In: Computational Logic and Set Theory. Springer, London. https://doi.org/10.1007/978-0-85729-808-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-0-85729-808-9_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-0-85729-807-2

  • Online ISBN: 978-0-85729-808-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics