Practical Foundations of Mathematics

Buy it online

Read it online

Corrections

p. 342, Lemma 6.5.7: The unification algorithm need not terminate if the "occurs check" fails, for example x = a b x , y = b a y , x = a y . The whole section needs to be reorganised, as the "occurs check" is currently introduced after this Lemma,

= , = , = . The whole section needs to be reorganised, as the "occurs check" is currently introduced after this Lemma, p. 523, Exercise 9.4: Thomas Streicher sent me a simple counterexample to the claim that fibrations preserve pullbacks. The exercise was replaced by another similar one in the 2000 reprint.

Back cover blurb (from the 2000 reprint)

Reviews

by Roy Dyckhoff for the Bulletin of the London Mathematical Society

by Peter Johnstone for Zentralblatt

by Thomas Streicher for Science of Computer Programming.

Used in seminars or lecture series

Cited in book lists

Web searches