Skip to main content

Logic and Theorem Proving

  • Chapter
Software Reliability Methods

Part of the book series: Texts in Computer Science ((TCS))

  • 570 Accesses

Abstract

Mathematical logic provides the basis of software verification methods. Like a programming language, a logic combines syntax, dictating how to write legal formulas, with semantics, which gives precise meaning to each formula. Mathematical logic formalizes the notion of a proof. In this chapter, we will survey first order and propositional logic. We will then study the essentials of mechanized theorem proving. Theorem proving tools usually do not provide full automation for obtaining proofs. Rather they are used to assist the user by imposing rigor and providing guidance during the proof process. In later chapters, we will show various logics and proof systems that can be used to prove properties of programs in a manual, computer-assisted or fully automatic way.

‘Contrariwise,’ continued Tweedledee, ‘if it was so, it might be; and if it were so, it would be; but as it isn’t, it ain’t. That’s logic.’

Lewis Carroll, Through the Looking Glass

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Further Reading

The following books can be used for an excellent introduction to mathematical logic

  • G. S. Boolos, D. J. Richard, Computability and Logic, Cambridge University Press, (3rd edition), 1989.

    Google Scholar 

  • D. van Dalen, Logic and Structure,Springer-Verlag, 3rd edition, 1994.

    Google Scholar 

  • H. D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic, Springer-Verlag, 1994.

    Google Scholar 

Several books describe a particular deductive theorem prover

  • R. S. Boyer, J. S. Moore, The Computational Logic Handbook, Academic Press, 1998.

    Google Scholar 

  • T. F. Melham, M. J. C. Gordon, Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, Cambridge University Press, 1993.

    Google Scholar 

  • L. C. Paulson, Logic and Computation: Interactive Proof with Cambridge LCF, Cambridge, 1990.

    Google Scholar 

  • N. Shankar, Mathematics, Machines and Godel’s Proof, Cambridge, 1997.

    Google Scholar 

  • L. Wos, The Automatic Reasoning: An Experimenter’s Notebook with Otter, Tutorial, Academic Press, 1996.

    Google Scholar 

  • L. Wos, Automated Reasoning: Introduction and Application, 2nd edition, McGraw-Hill, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Lucent Technologies

About this chapter

Cite this chapter

Peled, D.A. (2001). Logic and Theorem Proving. In: Software Reliability Methods. Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3540-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3540-6_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4419-2876-4

  • Online ISBN: 978-1-4757-3540-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics