Productive sets and constructively nonpartial-recursive functions
In this short note the author extends some results of \textit{B. M. Horowitz} [Notre Dame J. Formal Logic 21, 273-276 (1980; Zbl 0394.03043)]. A partial function \(f: {\mathbb{N}}\to {\mathbb{N}}\) is called constructively nonpartial-recursive if for some recursive function \(h: {\mathbb{N}}\to {\mathbb{N}}\), f(h(n))\(\not\cong \phi_ n(h(n))\). It is called strongly constructively nonpartial-recursive if in addition there is a recursive function \(e: {\mathbb{N}}\to {\mathbb{N}}\) such that f(h(n)) defined implies \(e(n)=f(h(n))\). The following results are obtained: f is strongly constructively nonpartial-recursive \(\Rightarrow\) \(G_ f\) is productive \(\Rightarrow\) f is constructively nonpartial-recursive. Furthermore, a set S is productive iff \(i_ A\) is constructively nonpartial-recursive, where \(i_ A(x)=x\) if \(x\in A\), and undefined otherwise.
- A proof-theoretic characterization of the primitive recursive set functions
- Recursive set constructions and iterated function systems. Separation conditions and dimension
- Productive functions and isomorphisms
- Provably recursive functions of constructive and relatively constructive theories
- Generalized recurrence and the nonwandering set for products
- On compactifications and product‐free sets
- Constructive sets in computable sets
- Products of Perfectly Meager Sets and Lusin's Function
- Products of Perfectly Meager Sets and Lusin's Function
- scientific article; zbMATH DE number 3885889
This page was built for publication: Productive sets and constructively nonpartial-recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105589)
