Sets Completely Creative Via Recursive Permutations

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):445-452 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19780242511

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

Sets Completely Creative Via Recursive Permutations.Bruce M. Horowitz - 1978 - Mathematical Logic Quarterly 24 (25‐30):445-452.
Retraceable Sets and Recursive Permutations.T. G. Mclaughlin - 1968 - Journal of Symbolic Logic 33 (1):114-114.
Review: Louise Hay, On Creative Sets and Indices of Partial Recursive Functions; Louise Hay, Isomorphism Types of Index Sets of Partial Recursive Functions; Louise Hay, Index Sets of Finite Classes of Recursively Enumerable Sets. [REVIEW]Forbes D. Lewis - 1974 - Journal of Symbolic Logic 39 (1):186-187.
Review: T. G. McLaughlin, Retraceable Sets and Recursive Permutations. [REVIEW]Fred J. Sansone - 1968 - Journal of Symbolic Logic 33 (1):114-114.
Myhill's work in recursion theory.J. C. E. Dekker & E. Ellentuck - 1992 - Annals of Pure and Applied Logic 56 (1-3):43-71.
On Creative Sets and Indices of Partial Recursive Functions.Louise Hay - 1974 - Journal of Symbolic Logic 39 (1):186-187.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Two Conjugate Primitive Recursive Permutations not Conjugate by a Primitive Recursive Permutation.Mark Finkelstein - 1971 - Mathematical Logic Quarterly 17 (1):1-3.
Two Conjugate Primitive Recursive Permutations not Conjugate by a Primitive Recursive Permutation.Mark Finkelstein - 1971 - Mathematical Logic Quarterly 17 (1):1-3.
Max and min limiters.James Owings, William Gasarch & Georgia Martin - 2002 - Archive for Mathematical Logic 41 (5):483-495.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Finitary Set Theory.Laurence Kirby - 2009 - Notre Dame Journal of Formal Logic 50 (3):227-244.
On primitive recursive permutations and their inverses.Frank B. Cannonito & Mark Finkelstein - 1969 - Journal of Symbolic Logic 34 (4):634-638.
Happy families and completely Ramsey sets.Pierre Matet - 1993 - Archive for Mathematical Logic 32 (3):151-171.
Ramsey sets, the Ramsey ideal, and other classes over R.Paul Corazza - 1992 - Journal of Symbolic Logic 57 (4):1441 - 1468.

Analytics

Added to PP
2016-02-04

Downloads
38 (#421,716)

6 months
7 (#438,648)

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.
Theory of Formal Systems.Raymond M. Smullyan - 1965 - Journal of Symbolic Logic 30 (1):88-90.

Add more references