Reducibility in some categories of partial recursive operators

&
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):349-359 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19920380133

Links

PhilArchive



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

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

Reducibility in some categories of partial recursive operators.Caterina Bianchini & Andrea Sorbi - 1992 - Mathematical Logic Quarterly 38 (1):349-359.
Creativeness and completeness in recursion categories of partial recursive operators.Franco Montagna & Andrea Sorbi - 1989 - Journal of Symbolic Logic 54 (3):1023-1041.
Analogy and Balancing: The Partial Reducibility Thesis and Its Problems.David Duarte - 2015 - Revus 25:141-154.
A Reducibility Related To Being Hyperimmune-free.Frank Stephan & Liang Yu - 2014 - Annals of Pure and Applied Logic 165 (7-8):1291-1300.
Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.
A characterization of the Δ⁰₂ hyperhyperimmune sets.Roland Sh Omanadze & Andrea Sorbi - 2008 - Journal of Symbolic Logic 73 (4):1407-1415.
Recursiveness of ω‐Operations.Victor L. Selivanov - 1994 - Mathematical Logic Quarterly 40 (2):204-206.
Review: A. V. Kuznecov, B. A. Trahtenbrot, An Investigation of Partial Recursive Operators by Means of the Theory of the Space of Baire. [REVIEW]J. W. Addison - 1957 - Journal of Symbolic Logic 22 (3):301-302.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Effective embeddings into strong degree structures.Timothy H. McNicholl - 2003 - Mathematical Logic Quarterly 49 (3):219.
Kleene index sets and functional m-degrees.Jeanleah Mohrherr - 1983 - Journal of Symbolic Logic 48 (3):829-840.
Turing L -machines and recursive computability for L -maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179 - 192.
Embeddings in the Strong Reducibilities Between 1 and npm.Phil Watson - 1997 - Mathematical Logic Quarterly 43 (4):559-568.
Coloring linear orders with Rado's partial order.Riccardo Camerlo & Alberto Marcone - 2007 - Mathematical Logic Quarterly 53 (3):301-305.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.

Analytics

Added to PP
2016-02-04

Downloads
31 (#503,056)

6 months
3 (#992,474)

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