Recursiveness of ω‐Operations

Mathematical Logic Quarterly 40 (2):204-206 (1994)
  Copy   BIBTEX

Abstract

It is well known that any finitary operation is recursive in a suitable total numeration. A. Orlicki showed that there is an ω-operation not recursive in any total numeration. We will show that any ω-operation is recursive in a partial numeration

Categories

Keywords

Reprint years

DOI

10.1002/malq.19940400207

Links

PhilArchive



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

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

Turing L -machines and recursive computability for L -maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179 - 192.
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.
Weak Presentations of Computable Fields.Carl G. Jockusch & Alexandra Shlapentokh - 1995 - Journal of Symbolic Logic 60 (1):199 - 208.
A restricted computation model on Scott domains and its partial primitive recursive functionals.Karl-Heinz Niggl - 1998 - Archive for Mathematical Logic 37 (7):443-481.
Non-definability of the Ackermann function with type 1 partial primitive recursion.Karl-Heinz Niggl - 1997 - Archive for Mathematical Logic 37 (1):1-13.
D-algebras.Stanley Gudder - 1996 - Foundations of Physics 26 (6):813-822.
Husserl on the 'Totality of all conceivable arithmetical operations'.Stefania Centrone - 2006 - History and Philosophy of Logic 27 (3):211-228.
A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
Ω-operations over partial enumerated sets.Andrzej Orlicki - 1993 - Mathematical Logic Quarterly 39 (1):551-558.
Some restrictions on simple fixed points of the integers.G. L. McColm - 1989 - Journal of Symbolic Logic 54 (4):1324-1345.
Combinatorial and recursive aspects of the automorphism group of the countable atomless Boolean algebra.E. W. Madison & B. Zimmermann-Huisgen - 1986 - Journal of Symbolic Logic 51 (2):292-301.
Uniform enumeration operations.A. H. Lachlan - 1975 - Journal of Symbolic Logic 40 (3):401-409.
Effective operations on partial recursive functions.J. Myhill & J. C. Shepherdson - 1955 - Mathematical Logic Quarterly 1 (4):310-317.

Analytics

Added to PP
2013-12-01

Downloads
104 (#169,303)

6 months
2 (#1,206,802)

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

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

Add more references