The Riemann Integral in Weak Systems of Analysis

dc.creatorFerreira,Fernando
dc.creatorFerreira,Gilda
dc.date2008
dc.date.accessioned2024-02-06T12:56:22Z
dc.date.available2024-02-06T12:56:22Z
dc.descriptionTaking as a starting point (a modification of) a weak theory of arithmetic of Jan Johannsen and Chris Pollett (connected with the hierarchy of counting functions), we introduce successively stronger theories of bounded arithmetic in order to set up a system for analysis (TCA2). The extended theories preserve the connection with the counting hierarchy in the sense that the algorithms which the systems prove to halt are exactly the ones in the hierarchy. We show that TCA2 has the exact strength to develop Riemannian integration for functions with a modulus of uniform continuity.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-014-06-0908
dc.identifierhttps://lib.jucs.org/article/29012/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9669
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 14(6): 908-937
dc.subjectweak analysis
dc.subjectRiemann integral
dc.subjectcounting hierarchy
dc.titleThe Riemann Integral in Weak Systems of Analysis
dc.typeResearch Article
Файлы
Коллекции