Publisher： Cambridge University Press
E-ISSN： 1943-5886|41|1|199-214
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.41, Iss.1, 1976-03, pp. : 199-214
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Some results on measure independent Gödel speed-ups
The Journal of Symbolic Logic, Vol. 43, Iss. 4, 1978-12 ,pp. :
Access to resources
Recommend
Two recursion theoretic characterizations of proof speed-ups
The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. :
On size vs. efficiency for programs admitting speed-ups
The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. :
On generalized computational complexity
The Journal of Symbolic Logic, Vol. 42, Iss. 1, 1977-03 ,pp. :
The complexity of continuous embeddability between dendrites
The Journal of Symbolic Logic, Vol. 69, Iss. 3, 2004-09 ,pp. :