• V. S. Alagar
  • K. Periyasamy
Part of the Graduate Texts in Computer Science book series (TCS)


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.


Temporal Logic Inference Rule Propositional Logic Atomic Formula Predicate Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [2]
    T. DeMarco, Structured Analysis and System Specification, Yourdon Press, New York, NY, 1978.Google Scholar
  3. [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. [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.MathSciNetCrossRefGoogle Scholar
  5. [5]
    C.B. Jones, Systematic Software Development using VDM (second edition), Prentice-Hall International (UK), 1990.zbMATHGoogle Scholar
  6. [6]
    F. Kröger, Temporal Logic of Programs, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin/Heidelberg, 1986.Google Scholar
  7. [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. [8]
    Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specifications, Springer-Verlag, New York, NY, 1992.CrossRefGoogle Scholar
  9. [9]
    B. Moszkowski, Executing Temporal Logic Programs, Cambridge University Press, Cambridge, England, 1986.Google Scholar
  10. [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.CrossRefGoogle Scholar
  11. [11]
    J.A. Robinson, “Logic and Logic Programming,” Communications of the ACM, Vol. 35, No. 3, 1992, pp. 41–65.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • V. S. Alagar
    • 1
  • K. Periyasamy
    • 2
  1. 1.Department of Computer ScienceConcordia UniversityMontrealCanada
  2. 2.Department of Computer ScienceUniversity of ManitobaWinnipegCanada

Personalised recommendations