A Comparison of Five “Computable” Operators

Mathematical Logic Quarterly 6 (15-22):325-340 (1960)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19600061510

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,953

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

A Comparison of Five “Computable” Operators.Marian Boykan Pour-El - 1960 - Mathematical Logic Quarterly 6 (15‐22):325-340.
Marian Boykan Pour-El and Ian Richards. A computable ordinary differential equation which possesses no computable solution, Annals of mathematical logic, vol. 17 , pp. 61–90. - Marian Boykan Pour-El and Ian Richards. The wave equation with computable initial data such that its unique solution is not computable. Advances in mathematics, vol. 39 , pp. 215–239. [REVIEW]G. Kreisel - 1982 - Journal of Symbolic Logic 47 (4):900-902.
Review: Marian Boykan Pour-El, Ian Richards, A Computable Ordinary Differential Equation with Possesses no Computable Solution; Marian Boykan Pour-El, Ian Richards, The Wave Equation with Computable Initial Data Such that its Unique Solution is not Computable. [REVIEW]G. Kreisel - 1982 - Journal of Symbolic Logic 47 (4):900-902.
On Effectively Computable Operators.John P. Helm - 1971 - Mathematical Logic Quarterly 17 (1):231-244.
On Effectively Computable Operators.John P. Helm - 1971 - Mathematical Logic Quarterly 17 (1):231-244.
Marian Boykan Pour-El. Independent axiomatization and its relation to the hypersimple set. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 , pp. 449–456. [REVIEW]Lawrence Feiner - 1973 - Journal of Symbolic Logic 38 (4):654-655.
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 , pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 99–100. [REVIEW]James C. Owings - 1973 - Journal of Symbolic Logic 38 (1):155-156.
Computability of compact operators on computable Banach spaces with bases.Vasco Brattka & Ruth Dillhage - 2007 - Mathematical Logic Quarterly 53 (4‐5):345-364.
Marian B. Pour-El and J. Ian Richards. Computability in analysis and physics. Perspectives in mathematical logic. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1989, xi + 206 pp. [REVIEW]Oliver Aberth - 1991 - Journal of Symbolic Logic 56 (2):749-750.
A uniformly computable Implicit Function Theorem.Timothy H. McNicholl - 2008 - Mathematical Logic Quarterly 54 (3):272-279.

Analytics

Added to PP
2016-02-04

Downloads
21 (#761,167)

6 months
6 (#588,321)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On effective topological spaces.Dieter Spreen - 1998 - Journal of Symbolic Logic 63 (1):185-221.
Effective operations in a general setting.A. H. Lachlan - 1964 - Journal of Symbolic Logic 29 (4):163-178.

Add more citations

References found in this work

No references found.

Add more references