Switch to: Citations

References in:

[Foreign Language Ignored]

[Foreign Language Ignored] [Foreign Language Ignored]

Mathematical Logic Quarterly 19 (30):453-468 (1973)

Add references

You must login to add references.

Ensembles Récursivement Mesurable et Ensembles Récursivement Ouverts ou Fermés.Georg Kreisel & Daniel Lacombe - 1966 - Journal of Symbolic Logic 31 (1):133-133.details Download Export citation Bookmark 5 citations
[Foreign Language Ignored].[Foreign Language Ignored] [Foreign Language Ignored] - 1973 - Mathematical Logic Quarterly 19 (30):453-468.details Download Export citation Bookmark 4 citations
(1 other version)On the interpretation of intuitionistic number theory.Stephen Cole Kleene - 1945 - Journal of Symbolic Logic 10 (4):109-124.details Download Export citation Bookmark 79 citations
On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.details Download Export citation Bookmark 22 citations
Manuel Blum. A Machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336. [REVIEW]Manuel Blum - 1970 - Journal of Symbolic Logic 34 (4):657-658.details Download Export citation Bookmark 24 citations
Komplexität von Algorithmen mit Anwendung auf die Analysis.Claus-Peter Schnorr - 1971 - Archive for Mathematical Logic 14 (1-2):54-68.details Download Export citation Bookmark 2 citations

1