The Enumerability and Invariance of Complexity Classes

Journal of Symbolic Logic 39 (2):349-349 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272693

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: F. D. Lewis, The Enumerability and Invariance of Complexity Classes. [REVIEW]Nancy A. Lynch - 1974 - Journal of Symbolic Logic 39 (2):349-349.
Lewis F. D.. The enumerability and invariance of complexity classes. Journal of computer and system sciences, vol. 5 , pp. 286–303. [REVIEW]Nancy A. Lynch - 1974 - Journal of Symbolic Logic 39 (2):349-349.
On injective enumerability of recursively enumerable classes of cofinite sets.Stephan Wehner - 1995 - Archive for Mathematical Logic 34 (3):183-196.
Review: J. Hartmanis, F. D. Lewis, The Use of Lists in the Study of Undecidable Problems in Automata Theory. [REVIEW]Dennis F. Cudia - 1974 - Journal of Symbolic Logic 39 (2):347-347.
Review: D. Hilbert, W. Ackermann, Lewis M. Hammond, George G. Leckie, F. Steinhardt, Robert E. Luce, Principles of Mathematical Logic. [REVIEW]G. Zubieta R. - 1951 - Journal of Symbolic Logic 16 (1):52-53.
Hartmanis J. and Lewis F. D.. The use of lists in the study of undecidable problems in automata theory. Journal of computer and system sciences, vol. 5 , pp. 54–66. [REVIEW]Dennis F. Cudia - 1974 - Journal of Symbolic Logic 39 (2):347-347.
On the Capture of Complexity Classes Using Logic.I. A. Stewart - 1991 - University of Newcastle Upon Tyne, Computing Laboratory.
On the Consistency of an Axiom of Enumerability.J. R. Shoenfield - 1959 - Journal of Symbolic Logic 24 (3):227-228.
Review: Harry R. Lewis, Unsolvable Classes of Quantificational Formulas. [REVIEW]Dieter Rodding - 1982 - Journal of Symbolic Logic 47 (1):221-222.
Recursive Enumerability and the Jump Operator.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (4):204-204.

Analytics

Added to PP
2015-02-05

Downloads
2 (#1,822,311)

6 months
2 (#1,445,278)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references