scientific article; zbMATH DE number 3557768
The following results are presented: 1.) A recursively enumerable set \(A\) is complete if and only if there is an index \(n\) such that \(W_{\varphi_n^A(x)} \neq W_x\). 2.) The number \(x\) is said to be an almost-fixpoint of \(f\) if and only if \(W_{f(x)}\Delta W_x\) is finite. Any function \(\varphi_n^{\emptyset'}\) has an almost-fixpoint. 3.) The number \(x\) is said to be a weak fixpoint of \(f\) if and only if either \(W_{f(x)}\) and \(W_x\), are finite or \(W_{f(x)}\) and \(W_x\) are infinite. Any function \(\varphi_n^A\) with \(\emptyset' \leq_T A \leq _T \emptyset\) has a weak fixpoint.
- Fixed-point selection functions
- Precomplete numberings
- Things that can be made into themselves
- Generic Kleene fixed point theorem
- Quasi-completeness and functions without fixed-points
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
- scientific article; zbMATH DE number 4125390 (Why is no real title available?)
- The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑5‐Complete
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- Marat Mirzaevich Arslanov (on his eightieth birthday)
- The notion of exhaustiveness and Ascoli-type theorems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133617)