On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis

DOI10.1016/0168-0072(86)90057-6zbMath0644.03035OpenAlexW2044052539MaRDI QIDQ1102283

Andrej Scedrov

Publication date: 1986

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(86)90057-6

zbMATH Keywords

collectioncontinuitycomputable functionscomputable analysisintuitionistic Zermelo-Fraenkel set theoryrelativized dependent choiceExtended Church's Thesis

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Metamathematics of constructive systems (03F50)

Related Items (1)

Lindenbaum algebras of intuitionistic theories and free categories

Cites Work

• The lack of definable witnesses and provably recursive functions in intuitionistic set theories
• Arithmetic transfinite induction and recursive well-orderings
• Church's thesis, continuity, and set theory
• Recursive metric spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis