Computing and Software 701
Logic and Discrete Mathematics in Software Engineering
Fall 2004
References
01 What is Mathematics?
- D. M. Bressoud, Proofs and Confirmations: The Story of the
Alternating-Sign Matrix Conjecture, Cambridge University Press,
1999.
- I. Lakatos, Proofs and Refutations,
Cambridge University Press, 1976.
-
Biographical Sketch of I. Lakatos.
02 What is Logic?
03 Propositional Logic
04 Numbers, Sets, Functions, and Relations
- P. R. Halmos, Abstract Naive Set Theory,
Springer-Verlag, 1987.
05 Mathematical Models
- J. Hopcraft, R. Motwani, and J. Ullman, Introduction to
Automata Theory, Languages, and Computation, Second Edition,
Addison Wesley, 2001.
06 First-Order Logic
- C. C. Chang and H. J. Keisler, Model Theory, North
Holland, 1990.
- H. B. Enderton, A Mathematical Introduction to Logic,
Academic Press, 1972.
- R. M. Smullyan, First-Order Logic, Dover publications,
1995.
07 Equational Logic and Algebraic Reasoning
- V. Sperschneider and G. Antoniou, Logic: A Foundation for
Computer Science, Addison Wesley, 1991.
- F. Baader and T. Nipkow, Term Rewriting and All That,
Springer, 1999.
08 Recursion and Induction
- W. M. Farmer, "A scheme for defining partial higher-order
functions by recursion", In: A. Butterfield, ed., 3rd Irish
Workshop on Formal Methods, 13 pp., electronic Workshops in
Computing, Springer-Verlag, 1999. PostScript PDF
09 Simple Type Theory
- P. B. Andrews, An Introduction to Mathematical Logic and Type
Theory: To Truth Through Proof, Kluwer, 2002.
- A. Church, "A formulation of the simple theory of types",
Journal of Symbolic Logic, 5:56-68, 1940.
- W. M. Farmer, "A basic extended simple type theory", SQRL
Report No. 14, 12 pp., McMaster University, 2004. PostScript PDF
- W. M. Farmer, "The seven virtues of simple type theory", SQRL
Report No. 18, 27 pp., McMaster University, 2004. PostScript
PDF
10 A Compendium of Mathematical Structures
- D. Dummit, R. Foote, and B. Holland, Abstract Algebra,
Second Edition, Wiley, 1999.
- MathWorld
- The Mathematics
Section of the Wikipedia
- E. Mendelson, Schaum's Outline of Boolean Algebra and
Switching Circuits, McGraw-Hill, 1970.
11 Simple Type Theory with Undefinedness
- W. M. Farmer, "A partial functions version of Church's simple
theory of types", Journal of Symbolic Logic, 55:1269-1291,
1990.
- W. M. Farmer, "Reasoning about partial functions with the aid
of a computer", Erkenntnis, 43:279-294, 1995.
- W. M. Farmer, "STMM: A Set Theory for Mechanized Mathematics",
Journal of Automated Reasoning, 26:269-289, 2001. PostScript PDF
- W. M. Farmer, "Formalizing undefinedness arising in calculus",
in: D. Basin and M. Rusinowitch, eds., Automated Reasoning,
LNCS, 3097:475-489, 2004.
12 Axiomatic Method
- J. Barwise and J. Seligman, Information Flow : The Logic of
Distributed Systems, Cambridge University Press, 1997.
- N. Bourbaki, Eléments de mathématique,
mid 1900s.
- R. Burstall and J. Goguen, "Putting theories together to make
specifications", Proceedings of the Fifth International Joint
Conference on Artificial Intelligence, pp. 1045-1058, 1977.
- Euclid, The Elements, 300 BC.
- W. M. Farmer, "Theory interpretation in simple type theory",
in: J. Heering et al., eds., Higher-Order Algebra, Logic, and
Term Rewriting, LNCS, 816:96-123, 1994. PostScript
PDF
- W. M. Farmer, J. D. Guttman, and F. J. Thayer, "Little
theories", in: D. Kapur, ed., Automated Deduction--CADE-11,
LNCS, 607:567-581, 1992. PostScript
PDF
- R. Nakajima and T. Yuasa (eds.), The IOTA Programming
System, LNCS, Vol. 160, 1982.
- Noneuclidean
Geometry.
- D. Sannella and A. Tarlecki, "Towards formal development of
programs from algebraic specifications: Implementations revisited",
Acta Informatica, 25:233-281, 1988.
- D. Smith and M. Lowry, "Algorithmic theories and design
tactics", Science of Computer Programming, 14:305-321, 1990
- W. Turski and T. Maibaum, The Specification of Computer
Programs, Addison-Wesley, 1987.
- A. N. Whitehead and B. Russell, Principia Mathematica,
Cambridge University Press, 1910-1913.