Computational speed-up by effective operators

&
Journal of Symbolic Logic 37 (1):55-68 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272545

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,458

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

Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. Time-restricted sequence generation. Journal of computer and system sciences, vol. 4 , pp. 50–73. [REVIEW]Jiˇrí Bečvář - 1975 - Journal of Symbolic Logic 40 (4):616-617.
Patrick C. Fischer. On formalisms for Turing machines. Journal of the Association for Computing Machinery, vol. 12 , pp. 570–580. - Stål Aanderaa and Patrick C. Fischer. The solvability of the halting problem for 2-state Post machines. Journal of the Association for Computing Machinery, vol. 14 , pp. 677–682. - Patrick C. Fischer. Quantificational variants on the halting problem for Turing machines. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 , pp. 211–218. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (3):532-534.
Albert R. Meyer and Rohit Parikh. Definability in dynamic logic. Journal of computer and system sciences, vol. 23 , pp. 279–298. [REVIEW]David Harel - 1984 - Journal of Symbolic Logic 49 (4):1420-1421.
Patrick C. Fischer. Theory of provable recursive functions. Transactions of the American Mathematical Society, vol. 117 , pp. 494–520. [REVIEW]H. B. Enderton - 1967 - Journal of Symbolic Logic 32 (2):270.
Fischer Patrick C.. A note on bounded-truth-table reducibility. Proceedings of the American Mathematical Society, vol. 14 , pp. 875–877. [REVIEW]Paul R. Young - 1970 - Journal of Symbolic Logic 35 (3):478.
Diversity of speed-ups and embeddability in computational complexity.Donald A. Alton - 1976 - Journal of Symbolic Logic 41 (1):199-214.
Routley-Meyer Semantics for E-R, Ee-R, Eec-R.Eun-Suk Yang - 2003 - Korean Journal of Logic 6 (1):19-32.
R. K. Meyer. Pure denumerable Łukasiewiczian implication. The journal of symbolic logic, vol. 31 , pp. 575–580.A. Rose - 1968 - Journal of Symbolic Logic 33 (2):308.
Storrs McCall and R. K. Meyer. Pure three-valued Łukasiewiczian implication. The journal of symbolic logic, vol. 31 , pp. 399–405.Atwell R. Turquette - 1968 - Journal of Symbolic Logic 33 (1):133-134.
Review: Robert K. Meyer, J. Michael Dunn, E, R and $gamma$. [REVIEW]David Makinson - 1971 - Journal of Symbolic Logic 36 (3):521-522.

Analytics

Added to PP
2009-01-28

Downloads
115 (#187,047)

6 months
15 (#207,985)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

New axiomatics for relevant logics, I.Robert K. Meyer - 1974 - Journal of Philosophical Logic 3 (1/2):53 - 86.
A characterization of complexity sequences.C. P. Schnorr & G. Stumpf - 1975 - Mathematical Logic Quarterly 21 (1):47-56.
Characterization of realizable space complexities.Joel I. Seiferas & Albert R. Meyer - 1995 - Annals of Pure and Applied Logic 73 (2):171-190.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references