Non-coding enumeration operators

DOI10.1007/978-3-030-51466-2_10OpenAlexW3037016679MaRDI QIDQ2106596FDOQ2106596

Authors Russell Miller

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-51466-2_10

zbMATH Keywords

computabilityHilbert's tenth problemcomputable structure theoryenumeration operatorsessential lowness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The Hilbert's-tenth-problem operator
• HTP-COMPLETE RINGS OF RATIONAL NUMBERS
• On the algebra of enumeration operators
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• The jump operator on the \(\omega \)-enumeration degrees

Cites work

• scientific article; zbMATH DE number 3715539 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• An introduction to computable model theory on groups and fields
• As easy as \(\mathbb {Q}\): Hilbert's tenth problem for subrings of the rationals and number fields
• Baire category theory and Hilbert's tenth problem inside \(\mathbb {Q}\)
• Categoricity properties for computable algebraic fields
• Computable fields and Galois theory
• Decidability of the “almost all” theory of degrees
• HTP-COMPLETE RINGS OF RATIONAL NUMBERS
• Isomorphism and classification for countable structures
• Measure theory and Hilbert's tenth problem inside \(\mathbb{Q} \)
• The Hilbert's-tenth-problem operator
• \(d\)-computable categoricity for algebraic fields

This page was built for publication: Non-coding enumeration operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106596)