Skip to main content

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

  • 316 Accesses

Abstract

Logic is a system for rational enquiry and is founded on axioms and inference rules for reasoning. Modern mathematical logic dates back to the works of Frege and Peano late in the 19th century. The first attempt to use computational power for proof procedures based on predicate calculus was made in the 1950s. Logic has influenced Artificial Intelligence, the design of programming languages, their semantics, program verification procedures, and the formal specification of software systems.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

References

  1. J. Bairwise and J. Etchemendy, The Language of First-Order Logic (third edition), Center for the Study of Language and Information, Stanford, CA, 1995.

    Google Scholar 

  2. T. DeMarco, Structured Analysis and System Specification, Yourdon Press, New York, NY, 1978.

    Google Scholar 

  3. E.A. Emerson, “Temporal and Modal Logic,” in J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1989, pp. 995–1072.

    Google Scholar 

  4. J. Grant and J. Minker, “The Impact of Logic Programming and Databases,” Communications of the ACM, Vol. 35, No. 3, 1992, pp. 67–81.

    Article  MathSciNet  Google Scholar 

  5. C.B. Jones, Systematic Software Development using VDM (second edition), Prentice-Hall International (UK), 1990.

    MATH  Google Scholar 

  6. F. Kröger, Temporal Logic of Programs, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin/Heidelberg, 1986.

    Google Scholar 

  7. L. Lamport, “What Good is Temporal Logic?” Invited Paper, Proceedings of IFIP’83 Congress — Information Processing, North-Holland, Amsterdam, 1983, pp. 657–668.

    Google Scholar 

  8. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specifications, Springer-Verlag, New York, NY, 1992.

    Book  Google Scholar 

  9. B. Moszkowski, Executing Temporal Logic Programs, Cambridge University Press, Cambridge, England, 1986.

    Google Scholar 

  10. S. Owiciki and L. Lamport, “Proving Liveness Properties of Concurrent Programs,” ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3, 1982, pp. 455–495.

    Article  Google Scholar 

  11. J.A. Robinson, “Logic and Logic Programming,” Communications of the ACM, Vol. 35, No. 3, 1992, pp. 41–65.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

Alagar, V.S., Periyasamy, K. (1998). Logic. In: Specification of Software Systems. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2920-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2920-7_6

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-2922-1

  • Online ISBN: 978-1-4757-2920-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics