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

DOI10.1016/0168-0072(86)90057-6MaRDI QIDQ1102283zbMATH OpenOpenAlexFDO

Authors Andre 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

collectioncomputable analysiscontinuitycomputable functionsintuitionistic Zermelo-Fraenkel set theoryrelativized dependent choiceExtended Church's Thesis

Mathematics Subject Classification ID

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

Recommendations

• Church's thesis, continuity, and set theory
• Feasibly continuous type-two functionals
• Arguments for the Continuity Principle
• Effective choice and boundedness principles in computable analysis
• Publication:4934288

Cites work

• scientific article; zbMATH DE number 3427308 (Why is no real title available?)
• scientific article; zbMATH DE number 3871350 (Why is no real title available?)
• scientific article; zbMATH DE number 3720907 (Why is no real title available?)
• scientific article; zbMATH DE number 3285221 (Why is no real title available?)
• scientific article; zbMATH DE number 3200656 (Why is no real title available?)
• Arithmetic transfinite induction and recursive well-orderings
• Church's thesis, continuity, and set theory
• Recursive metric spaces
• The lack of definable witnesses and provably recursive functions in intuitionistic set theories

Cited in

(4)

• Computable analysis and notions of continuity in \textsc{Coq}
• Lindenbaum algebras of intuitionistic theories and free categories
• scientific article; zbMATH DE number 3057871 (Why is no real title available?)
• Church's thesis, continuity, and set theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102283)