The knaster-tarski fixed-point theorem is not uniformly constructive
From MaRDI portal
Publication:3800032
DOI10.1080/00207168708803605zbMath0654.03047MaRDI QIDQ3800032
Publication date: 1987
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168708803605
constructive proof; semantics of recursive programs; algorithmically computable functions; Knaster-Tarski fixed- point theorem; uniform constructivity
03F60: Constructive and recursive analysis
68Q60: Specification and verification (program logics, model checking, etc.)
68W99: Algorithms in computer science
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Cites Work