Acceptable Numerations of Morphisms and Myhill‐Shepherdson Property

Mathematical Logic Quarterly 41 (1):39-48 (1995)
  Copy   BIBTEX

Abstract

Myhill-Shepherdson property in recursive function theory states that extensional effective program transformations determine continuous operations on partial functions. Case showed that this property fails to characterize acceptability of numberings of partial recursive functions. In this note we present a higher type analogue to Myhill-Shepherdson property. Our purpose is to show that higher type Myhill-Shepherdson property characterizes weak acceptability under a natural condition

Categories

Keywords

Reprint years

DOI

10.1002/malq.19950410105

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Note on a system of Myhill.J. C. Shepherdson - 1956 - Journal of Symbolic Logic 21 (3):261-264.
Effective operations on partial recursive functions.J. Myhill & J. C. Shepherdson - 1955 - Mathematical Logic Quarterly 1 (4):310-317.
Review: J. Myhill, J. C. Shepherdson, Effective Operations on Partial Recursive Functions. [REVIEW]J. C. E. Dekker - 1957 - Journal of Symbolic Logic 22 (3):303-303.
Acceptable Numerations of Function Spaces.Akira Kanda - 1985 - Mathematical Logic Quarterly 31 (31‐34):503-508.
Review: A. H. Kruse, Grothendieck Universes and the Super-Complete Models of Shepherdson. [REVIEW]J. C. Shepherdson - 1972 - Journal of Symbolic Logic 37 (3):613-613.
Empirical meaningfulness and intuitionistic logic.John Myhill - 1972 - Philosophy and Phenomenological Research 33 (2):186-191.
Review: A. Frohlich, J. C. Shepherdson, On the Factorisation of Polynomials in a Finite Number of Steps; A. Frohlich, J. C. Shepherdson, Effective Procedures in Field Theory. [REVIEW]Michael O. Rabin - 1959 - Journal of Symbolic Logic 24 (2):169-170.
Review: Errett Bishop, Foundations of Constructive Analysis; Errett Bishop, A. Kino, J. Myhill, R. E. Vesley, Mathematics as a Numerical Language. [REVIEW]John Myhill - 1972 - Journal of Symbolic Logic 37 (4):744-747.
The two-property and condensed detachment.J. A. Kalman - 1982 - Studia Logica 41 (2-3):173 - 179.
Review: G. P. Zykin, Comment on a Theorem of Hao Wang. [REVIEW]J. C. Shepherdson - 1971 - Journal of Symbolic Logic 36 (3):534-534.
Review: C. R. J. Clapham, An Embedding Theorem for Finitely Generated Groups. [REVIEW]J. C. Shepherdson - 1970 - Journal of Symbolic Logic 35 (2):340-341.
E. W. Beth. Some consequences of the theorem of Löwenheim-Skolem-Gödel-Malcev. Ibid., vol. 56 , pp. 66–71; and Ibid., vol. 15 , pp. 66–71. [REVIEW]J. C. Shepherdson - 1954 - Journal of Symbolic Logic 19 (1):61-61.

Analytics

Added to PP
2013-12-01

Downloads
19 (#753,814)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.

Add more references