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 language | English |
|---|---|
| Title of host publication | Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Proceedings |
| Publisher | Springer Verlag |
| Pages | 186-195 |
| Number of pages | 10 |
| Volume | 9136 |
| ISBN (Print) | 9783319200279 |
| DOIs | |
| Publication status | Published - 2015 |
| Externally published | Yes |
| Event | 11th Conference on Computability in Europe, CiE 2015 - Bucharest Duration: 2015 Jun 29 → 2015 Jul 3 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 9136 |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 11th Conference on Computability in Europe, CiE 2015 |
|---|---|
| City | Bucharest |
| Period | 15/6/29 → 15/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