diff -r ebf373c17ee2 -r 2457042caac8 doc-src/Logics/logics.bbl
--- a/doc-src/Logics/logics.bbl	Fri Sep 09 12:25:56 1994 +0200
+++ b/doc-src/Logics/logics.bbl	Fri Sep 09 12:34:54 1994 +0200
@@ -1,5 +1,11 @@
 \begin{thebibliography}{10}
 
+\bibitem{abrial93}
+J.~R. Abrial and G.~Laffitte.
+\newblock Towards the mechanization of the proofs of some classical theorems of
+  set theory.
+\newblock preprint, February 1993.
+
 \bibitem{andrews86}
 Peter~B. Andrews.
 \newblock {\em An Introduction to Mathematical Logic and Type Theory: To Truth
@@ -10,24 +16,25 @@
 David Basin and Matt Kaufmann.
 \newblock The {Boyer-Moore} prover and {Nuprl}: An experimental comparison.
 \newblock In {G\'erard} Huet and Gordon Plotkin, editors, {\em Logical
-  Frameworks}, pages 89--119. 1991.
+  Frameworks}, pages 89--119. Cambridge University Press, 1991.
 
 \bibitem{boyer86}
 Robert Boyer, Ewing Lusk, William McCune, Ross Overbeek, Mark Stickel, and
   Lawrence Wos.
 \newblock Set theory in first-order logic: Clauses for {G\"odel's} axioms.
-\newblock 2(3):287--327, 1986.
+\newblock {\em Journal of Automated Reasoning}, 2(3):287--327, 1986.
 
 \bibitem{camilleri92}
 J.~Camilleri and T.~F. Melham.
 \newblock Reasoning with inductively defined relations in the {HOL} theorem
   prover.
-\newblock Technical Report 265, August 1992.
+\newblock Technical Report 265, Computer Laboratory, University of Cambridge,
+  August 1992.
 
 \bibitem{church40}
 Alonzo Church.
 \newblock A formulation of the simple theory of types.
-\newblock 5:56--68, 1940.
+\newblock {\em Journal of Symbolic Logic}, 5:56--68, 1940.
 
 \bibitem{coen92}
 Martin~D. Coen.
@@ -39,12 +46,12 @@
 R.~L. {Constable et al.}
 \newblock {\em Implementing Mathematics with the Nuprl Proof Development
   System}.
-\newblock 1986.
+\newblock Prentice-Hall, 1986.
 
 \bibitem{davey&priestley}
 B.~A. Davey and H.~A. Priestley.
 \newblock {\em Introduction to Lattices and Order}.
-\newblock 1990.
+\newblock Cambridge University Press, 1990.
 
 \bibitem{devlin79}
 Keith~J. Devlin.
@@ -59,7 +66,7 @@
 \bibitem{dyckhoff}
 Roy Dyckhoff.
 \newblock Contraction-free sequent calculi for intuitionistic logic.
-\newblock 57(3):795--807, 1992.
+\newblock {\em Journal of Symbolic Logic}, 57(3):795--807, 1992.
 
 \bibitem{felty91a}
 Amy Felty.
@@ -72,7 +79,8 @@
 \bibitem{frost93}
 Jacob Frost.
 \newblock A case study of co-induction in {Isabelle HOL}.
-\newblock Technical Report 308, August 1993.
+\newblock Technical Report 308, Computer Laboratory, University of Cambridge,
+  August 1993.
 
 \bibitem{gallier86}
 J.~H. Gallier.
@@ -84,7 +92,7 @@
 M.~J.~C. Gordon and T.~F. Melham.
 \newblock {\em Introduction to {HOL}: A Theorem Proving Environment for Higher
   Order Logic}.
-\newblock 1993.
+\newblock Cambridge University Press, 1993.
 
 \bibitem{halmos60}
 Paul~R. Halmos.
@@ -97,11 +105,16 @@
   second-order patterns.
 \newblock {\em Acta Informatica}, 11:31--55, 1978.
 
+\bibitem{kunen80}
+Kenneth Kunen.
+\newblock {\em Set Theory: An Introduction to Independence Proofs}.
+\newblock North-Holland, 1980.
+
 \bibitem{alf}
 Lena Magnusson and Bengt {Nordstr\"om}.
 \newblock The {ALF} proof editor and its proof engine.
-\newblock In {\em : International Workshop {TYPES '93}}, pages 213--237.
-  Springer, published 1994.
+\newblock In {\em Types for Proofs and Programs: International Workshop {TYPES
+  '93}}, pages 213--237. Springer, published 1994.
 \newblock LNCS 806.
 
 \bibitem{mw81}
@@ -129,7 +142,7 @@
 \bibitem{noel}
 Philippe {No\"el}.
 \newblock Experimenting with {Isabelle} in {ZF} set theory.
-\newblock 10(1):15--58, 1993.
+\newblock {\em Journal of Automated Reasoning}, 10(1):15--58, 1993.
 
 \bibitem{nordstrom90}
 Bengt {Nordstr\"om}, Kent Petersson, and Jan Smith.
@@ -150,7 +163,7 @@
 \bibitem{paulson87}
 Lawrence~C. Paulson.
 \newblock {\em Logic and Computation: Interactive proof with Cambridge LCF}.
-\newblock 1987.
+\newblock Cambridge University Press, 1987.
 
 \bibitem{paulson-COLOG}
 Lawrence~C. Paulson.
@@ -163,43 +176,48 @@
 \bibitem{paulson-coind}
 Lawrence~C. Paulson.
 \newblock Co-induction and co-recursion in higher-order logic.
-\newblock Technical Report 304, July 1993.
-
-\bibitem{paulson-fixedpt}
-Lawrence~C. Paulson.
-\newblock A fixedpoint approach to implementing (co)inductive definitions.
-\newblock Technical Report 320, December 1993.
+\newblock Technical Report 304, Computer Laboratory, University of Cambridge,
+  July 1993.
 
 \bibitem{paulson-set-I}
 Lawrence~C. Paulson.
 \newblock Set theory for verification: {I}. {From} foundations to functions.
-\newblock 11(3):353--389, 1993.
+\newblock {\em Journal of Automated Reasoning}, 11(3):353--389, 1993.
 
 \bibitem{paulson-set-II}
 Lawrence~C. Paulson.
 \newblock Set theory for verification: {II}. {Induction} and recursion.
-\newblock Technical Report 312, 1993.
+\newblock Technical Report 312, Computer Laboratory, University of Cambridge,
+  1993.
 
 \bibitem{paulson-final}
 Lawrence~C. Paulson.
 \newblock A concrete final coalgebra theorem for {ZF} set theory.
-\newblock Technical report, 1994.
+\newblock Technical Report 334, Computer Laboratory, University of Cambridge,
+  1994.
+
+\bibitem{paulson-CADE}
+Lawrence~C. Paulson.
+\newblock A fixedpoint approach to implementing (co)inductive definitions.
+\newblock In Alan Bundy, editor, {\em 12th International Conference on
+  Automated Deduction}, pages 148--161. Springer, 1994.
+\newblock LNAI 814.
 
 \bibitem{pelletier86}
 F.~J. Pelletier.
 \newblock Seventy-five problems for testing automatic theorem provers.
-\newblock 2:191--216, 1986.
+\newblock {\em Journal of Automated Reasoning}, 2:191--216, 1986.
 \newblock Errata, JAR 4 (1988), 235--236.
 
 \bibitem{plaisted90}
 David~A. Plaisted.
 \newblock A sequent-style model elimination strategy and a positive refinement.
-\newblock 6(4):389--402, 1990.
+\newblock {\em Journal of Automated Reasoning}, 6(4):389--402, 1990.
 
 \bibitem{quaife92}
 Art Quaife.
 \newblock Automated deduction in {von Neumann-Bernays-G\"odel} set theory.
-\newblock 8(1):91--147, 1992.
+\newblock {\em Journal of Automated Reasoning}, 8(1):91--147, 1992.
 
 \bibitem{suppes72}
 Patrick Suppes.
@@ -219,7 +237,12 @@
 \bibitem{principia}
 A.~N. Whitehead and B.~Russell.
 \newblock {\em Principia Mathematica}.
-\newblock 1962.
+\newblock Cambridge University Press, 1962.
 \newblock Paperback edition to *56, abridged from the 2nd edition (1927).
 
+\bibitem{winskel93}
+Glynn Winskel.
+\newblock {\em The Formal Semantics of Programming Languages}.
+\newblock MIT Press, 1993.
+
 \end{thebibliography}