Table of Contents

1: Martin Löf's Type Theory
2: Categorical Logic
3: A Uniform Method for Proving Lower Bounds on the Computational complexity of Logical Theories
4: Algebraic specification of abstract data types
5: Computable Functions and Semicomputable Sets on Many-sorted Algebras

About the Author

S Abramsky, Department of Computing, Imperial College of Science, Technology and Medicine, London Dov Gabbay, Department of Computer Science, King's College, London T S E Maibaum, Department of Computing, Imperial College of Science, Technology and Medicine, London

Reviews

"Oxford University Press publishes a wonderful series of books entitled Handbook of Logic in Computer Science. ... Volume 5: Logic and Algebraic Methods, has I think the best discussion of abstract data types that I have read."--he Bulletin of Mathematics Books