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

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

zbMATH Keywords

computabilityHilbert's tenth problemcomputable structure theoryenumeration operatorsessential lowness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• \(d\)-computable categoricity for algebraic fields
• Title not available (Why is that?)
• Computable fields and Galois theory
• An introduction to computable model theory on groups and fields
• Decidability of the “almost all” theory of degrees
• Categoricity properties for computable algebraic fields
• Isomorphism and classification for countable structures
• The Hilbert's-tenth-problem operator
• Baire category theory and Hilbert's tenth problem inside \(\mathbb {Q}\)
• HTP-COMPLETE RINGS OF RATIONAL NUMBERS
• Measure theory and Hilbert's tenth problem inside \(\mathbb{Q} \)
• As easy as \(\mathbb {Q}\): Hilbert's tenth problem for subrings of the rationals and number 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)