A feasible theory for analysis

DOI10.2307/2275924zbMath0808.03043OpenAlexW2139227798MaRDI QIDQ4314687

Fernando Ferreira

Publication date: 15 March 1995

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275924

zbMATH Keywords

provably total functionspolynomial time computable functionsfirst-order strengthweak König's lemma for trees defined by bounded formulaeweak second- order theory of arithmetic

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35)

Related Items (13)

2000 Annual Meeting of the Association for Symbolic Logic ⋮ Bounded functional interpretation and feasible analysis ⋮ Strict \({\varPi^1_1}\)-reflection in bounded arithmetic ⋮ Bounded theories for polyspace computability ⋮ Polynomial time operations in explicit mathematics ⋮ Harrington's conservation theorem redone ⋮ Where pigeonhole principles meet Koenig lemmas ⋮ Bounded functional interpretation ⋮ 2006 Annual Meeting of the Association for Symbolic Logic ⋮ 2003 Annual Meeting of the Association for Symbolic Logic ⋮ Forcing in Proof Theory ⋮ The counting hierarchy in binary notation ⋮ Groundwork for weak analysis

This page was built for publication: A feasible theory for analysis