Fixed point theorems for minimal numberings
From MaRDI portal
Cites work
- A problem of S. S. Goncharov
- Computability and numberings
- CONSTRUCTIVE ALGEBRAS I
- Effective extendability and fixed-points
- Effectively infinite classes of numberings and fixed point theorems
- Extremal numberings and fixed point theorems
- Fixed point theorems for precomplete numberings
- Fixed-point selection functions
- Generalized computable numerations and nontrivial Rogers semilattices
- Generalized computable universal numberings
- Gödel numberings of partial recursive functions
- scientific article; zbMATH DE number 3827843 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1746561 (Why is no real title available?)
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- Index sets of quotient objects of the Post numeration
- Khutoretskii's theorem for generalized computable families
- Local structure of Rogers semilattices of Σn 0-computable numberings
- Numberings, c.e. oracles, and fixed points
- On inseparable pairs
- On weakly pre-complete positive equivalences
- Precomplete numberings
- Reductions between types of numberings
- Some independence results for control structures in complete numberings
- The Rogers semilattices of generalized computable enumerations
- Turing computability. Theory and applications
This page was built for publication: Fixed point theorems for minimal numberings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915769)
