Computability and numberings
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2007861
- Khutoretskii's theorem for generalized computable families
- Local structure of Rogers semilattices of Σn 0-computable numberings
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy
- Theories of Rogers semilattices of analytical numberings
Cited in
(27)- Numberings in the analytical hierarchy
- Some absolute properties of \(A\)-computable numberings
- Elementary theories and hereditary undecidability for semilattices of numberings
- On universal pairs in the Ershov hierarchy
- Friedberg numberings of families of partial computable functionals
- Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
- Rogers semilattices of limitwise monotonic numberings
- Universal generalized computable numberings and hyperimmunity
- An approach to the classification of minimal numberings of families of arithmetical sets
- Representations versus numberings: On the relationship of two computability notions
- On e-principal and e-complete numberings
- Weakly precomplete equivalence relations in the Ershov hierarchy
- On arithmetical numberings in reverse mathematics
- scientific article; zbMATH DE number 4145890 (Why is no real title available?)
- Countability constraints in order-theoretic approaches to computability
- scientific article; zbMATH DE number 3557772 (Why is no real title available?)
- Rogers semilattices of punctual numberings
- Computing with Numbers and Other Non-syntactic Things: De re Knowledge of Abstract Objects†
- On cardinalities of Rogers semilattices for families in the Ershov hierarchy
- Representations of natural numbers and computability of various functions
- Minimal generalized computable numberings and families of positive preorders
- Some properties of precompletely and positively numbered sets
- Fixed point theorems for minimal numberings
- Sums of computable ordinals
- scientific article; zbMATH DE number 2007871 (Why is no real title available?)
- Khutoretskii's theorem for generalized computable families
- Generalized computable universal numberings
This page was built for publication: Computability and numberings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384966)
