The knaster-tarski fixed-point theorem is not uniformly constructive

DOI10.1080/00207168708803605zbMath0654.03047OpenAlexW2104034601MaRDI QIDQ3800032

Cristian Artemi

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

zbMATH Keywords

constructive proofsemantics of recursive programsalgorithmically computable functionsKnaster-Tarski fixed- point theoremuniform constructivity

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• A computable ordinary differential equation which possesses no computable solution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The knaster-tarski fixed-point theorem is not uniformly constructive