On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
Annals of Pure and Applied Logic 32:291-297 (1986)
Abstract
This article has no associated abstract. (fix it)DOI
10.1016/0168-0072(86)90057-6
My notes
Similar books and articles
Upper Bounds for metapredicative mahlo in explicit mathematics and admissible set theory.Gerhard Jäger & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
Discontinuities of provably correct operators on the provably recursive real numbers.William J. Collins & Paul Young - 1983 - Journal of Symbolic Logic 48 (4):913-920.
d-computable Categoricity for Algebraic Fields.Russell Miller - 2009 - Journal of Symbolic Logic 74 (4):1325 - 1351.
Computable categoricity of trees of finite height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study.Andreas Weiermann - 1998 - Journal of Symbolic Logic 63 (4):1348-1370.
Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility; Neil Immerman, Relational Queries Computable in Polynomial Time; Neil Immerman, Languages that Capture Complexity Classes. [REVIEW]Samuel Buss - 1989 - Journal of Symbolic Logic 54 (1):287-288.
Obscuring length changes during animated motion.Jason Harrison, Ronald A. Rensink & Michiel van de Panne - 2004 - ACM Transactions on Graphics 23:569-573.
Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.
Analytics
Added to PP
2014-01-16
Downloads
4 (#1,240,690)
6 months
1 (#454,876)
2014-01-16
Downloads
4 (#1,240,690)
6 months
1 (#454,876)
Historical graph of downloads
Citations of this work
Lindenbaum algebras of intuitionistic theories and free categories.Peter Freyd, Harvey Friedman & Andre Scedrov - 1987 - Annals of Pure and Applied Logic 35 (C):167-172.
References found in this work
Some applications of Kleene's methods for intuitionistic systems.Harvey Friedman - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 113--170.
Church's thesis, continuity, and set theory.M. Beeson & A. Ščedrov - 1984 - Journal of Symbolic Logic 49 (2):630-643.
