Undecidable Complexity Statements in $E^\alpha_\mathbf{S}$-Arithmetic
Sigal, Ron
J. Symbolic Logic, Tome 54 (1989) no. 1, p. 415-427 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1989-06-14
Classification:  
@article{1183742914,
     author = {Sigal, Ron},
     title = {Undecidable Complexity Statements in $E^\alpha\_\mathbf{S}$-Arithmetic},
     journal = {J. Symbolic Logic},
     volume = {54},
     number = {1},
     year = {1989},
     pages = { 415-427},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742914}
}

Sigal, Ron. Undecidable Complexity Statements in $E^\alpha_\mathbf{S}$-Arithmetic. J. Symbolic Logic, Tome 54 (1989) no. 1, pp.  415-427. http://gdmltest.u-ga.fr/item/1183742914/