User loginNavigation 
FixedPoint InductionLately I started learning by myself the domain theory approach to semantics using G. Plotkin's "Domains" (1983). While doing the excercises, I bumped into the next question regarding fixedpoint induction: Let f,g: D > D be continuous functions, such that f.f.g = g.f, and f __ = g__. Show that Yf = Yg. (Here `.' is the analytic function composition: f.g(x) = f(g(x)) and __ denotes the least element, of course). [Chap. 2 question 21] It is more or less clear how to prove it using normal induction and the least fixed point formula, but I have no idea which inclusive predicates to choose. I was hoping someone here could supply some hints\directions. On a more general note: Is there an intuition as to how to choose these inclusive predicates? I imagine it is acquired in time and practice, so do you know of a list of properties that can be proved using fixedpoint induction? Thanks in advance, By Ohad Kammar at 20060914 09:02  LtU Forum  previous forum topic  next forum topic  other blogs  6168 reads

Browse archivesActive forum topics 
Recent comments
11 hours 7 min ago
13 hours 6 min ago
19 hours 1 min ago
1 day 11 hours ago
1 day 20 hours ago
2 days 7 hours ago
2 days 8 hours ago
2 days 9 hours ago
2 days 10 hours ago
2 days 10 hours ago