Intuitionistic provability versus uniform provability in RCA

Makoto Fujiwara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We provide an exact formalization of uniform provability in RCA and show that for any Π1/2 sentence of some syntactical form, it is intuitionistically provable if and only if it is uniformly provable in RCA.

Original languageEnglish
Title of host publicationEvolving Computability - 11th Conference on Computability in Europe, CiE 2015, Proceedings
PublisherSpringer Verlag
Pages186-195
Number of pages10
Volume9136
ISBN (Print)9783319200279
DOIs
Publication statusPublished - 2015
Externally publishedYes
Event11th Conference on Computability in Europe, CiE 2015 - Bucharest
Duration: 2015 Jun 292015 Jul 3

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9136
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other11th Conference on Computability in Europe, CiE 2015
CityBucharest
Period15/6/2915/7/3

    Fingerprint

Keywords

  • Computable analysis
  • Constructive mathematics
  • Medvedev reducibility
  • Reverse mathematics

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Fujiwara, M. (2015). Intuitionistic provability versus uniform provability in RCA. In Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Proceedings (Vol. 9136, pp. 186-195). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9136). Springer Verlag. https://doi.org/10.1007/978-3-319-20028-6_19