Set Theory for Computer Science - University of Cambridge

www.cl.cam.ac.uk

Inductive de nitions as least xed points. Tarski’s xed point theorem for monotonic functions on a powerset. Maximum xed points and coinduction. Well-founded induction: Well-founded relations and well-founded induc-tion. Examples. Constructing well-founded relations, including product and lexicographic product of well-founded relations ...

  Well, Relations, Relations and well