• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Uniform computability verified in a mathematically strong system and semi-intuitionistic provability for existence sentences

Research Project

Project/Area Number 16H07289
Research Category

Grant-in-Aid for Research Activity Start-up

Allocation TypeSingle-year Grants
Research Field Foundations of mathematics/Applied mathematics
Research InstitutionWaseda University

Principal Investigator

Fujiwara Makoto  早稲田大学, 高等研究所, 助教 (20779095)

Research Collaborator KOHLENBACH Ulrich  Technische Universität Darmstadt, Department of Mathematics, Professor
Project Period (FY) 2016-08-26 – 2018-03-31
Project Status Completed (Fiscal Year 2017)
Budget Amount *help
¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
Fiscal Year 2017: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2016: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Keywords構成的数学 / 計算可能数学 / 逆数学 / 存在定理 / 直観主義算術 / 論理原理 / 数学基礎論
Outline of Final Research Achievements

We show that for any existence sentences of some syntactical form, the solution is uniformly computable in the sense of primitive recursive functionals in all finite types and its verification can be carried out in the classical arithmetic containing arithmetical comprehension axiom in all finite types if and only if the existence sentence is provable in semi-intuitionistic finite-type arithmetic containing the numerical double negation shift scheme restricted to Sigma02 formulas with function parameters and the axiom schema of countable choice for numbers.
In addition, we analyze the interrelation between the semi-intuitionistic system mentioned above and other semi-intuitionistic systems considered in constructive reverse mathematics.

Report

(3 results)
  • 2017 Annual Research Report   Final Research Report ( PDF )
  • 2016 Annual Research Report
  • Research Products

    (4 results)

All 2017 2016

All Journal Article (1 results) (of which Peer Reviewed: 1 results) Presentation (2 results) (of which Int'l Joint Research: 2 results,  Invited: 1 results) Funded Workshop (1 results)

  • [Journal Article] Effective computability and constructive provability for existence sentences (Abstract)2017

    • Author(s)
      Makoto Fujiwara
    • Journal Title

      The Bulletin of Symbolic Logic

      Volume: vol. 23, no.2 Pages: 241-242

    • Related Report
      2017 Annual Research Report 2016 Annual Research Report
    • Peer Reviewed
  • [Presentation] Reverse mathematics and uniform provability2017

    • Author(s)
      Makoto Fujiwara
    • Organizer
      Philosophy of logic and Mathematics - Towards Philosophy of Proofs
    • Place of Presentation
      Keio University
    • Related Report
      2016 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] Effective computability and constructive provability for existence sentences2016

    • Author(s)
      Makoto Fujiwara
    • Organizer
      JSPS Core-to-Core Program "Mathematical Logic and its Applications"
    • Place of Presentation
      Kyoto University
    • Related Report
      2016 Annual Research Report
    • Int'l Joint Research
  • [Funded Workshop] Computability Theory and Foundations of Mathematics 20162016

    • Place of Presentation
      早稲田大学国際会議場
    • Year and Date
      2016-09-20
    • Related Report
      2016 Annual Research Report

URL: 

Published: 2016-09-02   Modified: 2019-03-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi