A note on the sequential version of Π2 1 statements

Makoto Fujiwara; Keita Yokoyama

doi:10.1007/978-3-642-39053-1_20

A note on the sequential version of Π₂ ¹ statements

Makoto Fujiwara, Keita Yokoyama

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

Abstract

In connection with uniform computability and intuitionistic provability, the strength of the sequential version of theorems has been investigated in reverse mathematics. In some examples, we illustrate that it occasionally depends on the way of formalizing the statement, so the investigation of sequential strength demands careful attention to the formalization. Moreover our results suggest the optimality of Dorais's uniformization theorems.

Original language	English
Title of host publication	The Nature of Computation: Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Proceedings
Pages	171-180
Number of pages	10
Volume	7921 LNCS
DOIs	https://doi.org/10.1007/978-3-642-39053-1_20
Publication status	Published - 2013
Externally published	Yes
Event	9th Conference on Computability in Europe - The Nature of Computation: Logic, Algorithms, Applications, CiE 2013 - Milan, Italy Duration: 2013 Jul 1 → 2013 Jul 5

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7921 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	9th Conference on Computability in Europe - The Nature of Computation: Logic, Algorithms, Applications, CiE 2013
Country/Territory	Italy
City	Milan
Period	13/7/1 → 13/7/5

ASJC Scopus subject areas

Computer Science(all)
Theoretical Computer Science

Access to Document

10.1007/978-3-642-39053-1_20

Cite this

Fujiwara, M., & Yokoyama, K. (2013). A note on the sequential version of Π₂ ¹ statements. In The Nature of Computation: Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Proceedings (Vol. 7921 LNCS, pp. 171-180). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7921 LNCS). https://doi.org/10.1007/978-3-642-39053-1_20

A note on the sequential version of Π₂ ¹ statements. / Fujiwara, Makoto; Yokoyama, Keita.

The Nature of Computation: Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Proceedings. Vol. 7921 LNCS 2013. p. 171-180 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7921 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Fujiwara, M & Yokoyama, K 2013, A note on the sequential version of Π₂ ¹ statements. in The Nature of Computation: Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Proceedings. vol. 7921 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7921 LNCS, pp. 171-180, 9th Conference on Computability in Europe - The Nature of Computation: Logic, Algorithms, Applications, CiE 2013, Milan, Italy, 13/7/1. https://doi.org/10.1007/978-3-642-39053-1_20

Fujiwara M, Yokoyama K. A note on the sequential version of Π₂ ¹ statements. In The Nature of Computation: Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Proceedings. Vol. 7921 LNCS. 2013. p. 171-180. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-39053-1_20

Fujiwara, Makoto ; Yokoyama, Keita. / A note on the sequential version of Π₂ ¹ statements. The Nature of Computation: Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Proceedings. Vol. 7921 LNCS 2013. pp. 171-180 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8949719653584204a726582dbc5e2fe1,

title = "A note on the sequential version of Π2 1 statements",

abstract = "In connection with uniform computability and intuitionistic provability, the strength of the sequential version of theorems has been investigated in reverse mathematics. In some examples, we illustrate that it occasionally depends on the way of formalizing the statement, so the investigation of sequential strength demands careful attention to the formalization. Moreover our results suggest the optimality of Dorais's uniformization theorems.",

author = "Makoto Fujiwara and Keita Yokoyama",

year = "2013",

doi = "10.1007/978-3-642-39053-1_20",

language = "English",

isbn = "9783642390524",

volume = "7921 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "171--180",

booktitle = "The Nature of Computation: Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Proceedings",

note = "9th Conference on Computability in Europe - The Nature of Computation: Logic, Algorithms, Applications, CiE 2013 ; Conference date: 01-07-2013 Through 05-07-2013",

}

TY - GEN

T1 - A note on the sequential version of Π2 1 statements

AU - Fujiwara, Makoto

AU - Yokoyama, Keita

PY - 2013

Y1 - 2013

N2 - In connection with uniform computability and intuitionistic provability, the strength of the sequential version of theorems has been investigated in reverse mathematics. In some examples, we illustrate that it occasionally depends on the way of formalizing the statement, so the investigation of sequential strength demands careful attention to the formalization. Moreover our results suggest the optimality of Dorais's uniformization theorems.

AB - In connection with uniform computability and intuitionistic provability, the strength of the sequential version of theorems has been investigated in reverse mathematics. In some examples, we illustrate that it occasionally depends on the way of formalizing the statement, so the investigation of sequential strength demands careful attention to the formalization. Moreover our results suggest the optimality of Dorais's uniformization theorems.

UR - http://www.scopus.com/inward/record.url?scp=84880421933&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880421933&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-39053-1_20

DO - 10.1007/978-3-642-39053-1_20

M3 - Conference contribution

AN - SCOPUS:84880421933

SN - 9783642390524

VL - 7921 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 171

EP - 180

BT - The Nature of Computation: Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Proceedings

T2 - 9th Conference on Computability in Europe - The Nature of Computation: Logic, Algorithms, Applications, CiE 2013

Y2 - 1 July 2013 through 5 July 2013

ER -