0
votes
1answer
44 views

Constructive fixed-point theorems where finite iteration yields the fixed point

I would like to show that $p$, a fixed point of some effective map $f : S\rightarrow S$, can be constructed effectively. Ideally, I would like there to exist a finite $n$ such that $p = f^n(p_0)$, ...
4
votes
1answer
200 views

In a complete lattice every monotone function has a fixpoint (Knaster–Tarski Theorem)

L is a complete lattice, so every subset has a supremum and infimum. In addition, there exists a function $f:L \rightarrow L$ such that $a \leq b$ implies $f(a) \leq f(b)$. Prove that there exists ...
7
votes
1answer
137 views

Least common fixed-point

I have been reading a book, "Introduction to Lattices and Order", and I'm trying to solve exercise 8.29 as the following in it: Suppose that $P$ is a complete lattice and let $F$ and $G$ be ...
7
votes
2answers
532 views

Is the Knaster-Tarski Fixed Point Theorem constructive?

According to Tarski's Fixed Point Theorem, for a complete lattice $L$, and monotone function $f:L \rightarrow L$, the set of fixed points of $f$ forms complete lattice. Definition of $lfp(f)$ and ...