∑1 definitions with parameters

Journal of Symbolic Logic 51 (2):453 - 461 (1986)
Abstract
Let p be a set. A function φ is uniformly σ 1 (p) in every admissible set if there is a σ 1 formula φ in the parameter p so that φ defines φ in every σ 1 -admissible set which includes p. A theorem of Van de Wiele states that if φ is a total function from sets to sets then φ is uniformly σ 1R in every admissible set if anly only if it is E-recursive. A function is ES p -recursive if it can be generated from the schemes for E-recursion together with a selection scheme over the transitive closure of p. The selection scheme is exactly what is needed to insure that the ES p - recursively enumerable predicates are closed under existential quantification over the transitive closure of p. Two theorems are established: a) If the transitive closure of p is countable than a total function on sets is ES p -recursive if and only if it is uniformly σ 1 (p) in every admissible set. b) For any p, if φ is a function on the ordinal numbers then φ is ES p -recursive if and only if it is uniformly ∑ 1 (p) in every admissible set
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274069
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,756
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Another Extension of Van de Wiele's Theorem.Robert S. Lubarsky - 1988 - Annals of Pure and Applied Logic 38 (3):301-306.

Add more citations

Similar books and articles
An Invariance Notion in Recursion Theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
The Pure Part of HYP(M).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
A Spector-Gandy Theorem for cPCd(A) Classes.Shaughan Lavine - 1992 - Journal of Symbolic Logic 57 (2):478 - 500.
Σ1-Separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.
HC of an Admissible Set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.

Monthly downloads

Added to index

2009-01-28

Total downloads

11 ( #406,857 of 2,177,862 )

Recent downloads (6 months)

1 ( #317,245 of 2,177,862 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums