Connections between identifying functionals, standardizing operations, and computable numberings

, &
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (9-11):145-164 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19840300904

Links

PhilArchive



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

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

Connections between identifying functionals, standardizing operations, and computable numberings.Rüsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1984 - Mathematical Logic Quarterly 30 (9‐11):145-164.
Inductive Inference and Computable One‐One Numberings.Rsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1982 - Mathematical Logic Quarterly 28 (27‐32):463-479.
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings.Rüsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1988 - Mathematical Logic Quarterly 34 (6):531-539.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Effectively closed sets and enumerations.Paul Brodhead & Douglas Cenzer - 2008 - Archive for Mathematical Logic 46 (7-8):565-582.
Stability of representations of effective partial algebras.Jens Blanck, Viggo Stoltenberg-Hansen & John V. Tucker - 2011 - Mathematical Logic Quarterly 57 (2):217-231.
A note on partial numberings.Serikzhan Badaev & Dieter Spreen - 2005 - Mathematical Logic Quarterly 51 (2):129-136.
A Real Number Structure that is Effectively Categorical.Peter Hertling - 1999 - Mathematical Logic Quarterly 45 (2):147-182.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Review: S. C. Kleene, Ernest Nagel, Patrick Suppes, Alfred Tarski, Turing-Machine Computable Functionals of Finite Types I; S. C. Kleene, Turing-Machine Computable Functionals of Finite Types II. [REVIEW]D. A. Clarke - 1970 - Journal of Symbolic Logic 35 (4):588-589.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin.Keng Meng Ng - 2009 - Notre Dame Journal of Formal Logic 50 (4):469-493.
Review: G. Kriesel, D. Lacombe, J. Shoenfield, Effective Operations and Partial Recursive Functionals; G. Kreisel, D. Lacombe, J. R. Shoenfield, Partial Recursive Functionals and Effective Operations. [REVIEW]Yiannis N. Moschovakis - 1966 - Journal of Symbolic Logic 31 (2):261-262.
Characterizing language identification in terms of computable numberings.Sanjay Jain & Arun Sharma - 1997 - Annals of Pure and Applied Logic 84 (1):51-72.
Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.

Analytics

Added to PP
2015-12-02

Downloads
25 (#628,404)

6 months
4 (#779,041)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Topological aspects of numberings.Wolfram Menzel & Frank Stephan - 2003 - Mathematical Logic Quarterly 49 (2):129-149.

Add more citations

References found in this work

Limiting recursion.E. Mark Gold - 1965 - Journal of Symbolic Logic 30 (1):28-48.

Add more references