On Non-principal Arithmetical Numberings and Families
From MaRDI portal
Publication:6489320
Cites work
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1746561 (Why is no real title available?)
- scientific article; zbMATH DE number 1873436 (Why is no real title available?)
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- Complete numerations with infinitely many singular elements
- Completely enumerated sets
- Computability and models. Perspectives east and west
- Degrees in Which the Recursive Sets are Uniformly Recursive
- Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets
- Extremal numberings and fixed point theorems
- Generalized computable numerations and nontrivial Rogers semilattices
- Generalized computable universal numberings
- Khutoretskii's theorem for generalized computable families
- Minimal generalized computable enumerations and high degrees
- Numberings, c.e. oracles, and fixed points
- ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
- On \(m\)-degrees of recursively enumerable sets
- On incomparable enumerations
- On inseparable pairs
- On nonprincipal enumerations
- On the embedding of the first nonconstructive ordinal in the Rogers semilattices
- Some independence results for control structures in complete numberings
- Some remarks on completions of numberings
- Subfamilies of special elements of complete numberings
- The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
- Turing computability. Theory and applications
This page was built for publication: On Non-principal Arithmetical Numberings and Families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489320)
