On Computational Complexity in Weakly Admissible Structures
Stoltenberg-Hansen, Viggo
J. Symbolic Logic, Tome 45 (1980) no. 1, p. 353-358 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1980-06-14
Classification:  
@article{1183740566,
     author = {Stoltenberg-Hansen, Viggo},
     title = {On Computational Complexity in Weakly Admissible Structures},
     journal = {J. Symbolic Logic},
     volume = {45},
     number = {1},
     year = {1980},
     pages = { 353-358},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183740566}
}

Stoltenberg-Hansen, Viggo. On Computational Complexity in Weakly Admissible Structures. J. Symbolic Logic, Tome 45 (1980) no. 1, pp.  353-358. http://gdmltest.u-ga.fr/item/1183740566/