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

DOI10.1016/0168-0072(86)90057-6zbMATH Open0644.03035OpenAlexW2044052539MaRDI QIDQ1102283FDOQ1102283

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

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

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)

Cites Work

• Title not available (Why is that?)
• The lack of definable witnesses and provably recursive functions in intuitionistic set theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive metric spaces
• Title not available (Why is that?)
• Church's thesis, continuity, and set theory
• Arithmetic transfinite induction and recursive well-orderings

Cited In (4)

• Lindenbaum algebras of intuitionistic theories and free categories
• Title not available (Why is that?)
• Computable analysis and notions of continuity in \textsc{Coq}
• 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)