Non-coding enumeration operators (Q2106596)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Non-coding enumeration operators	scientific article

Statements

scholarly article

0 references

Non-coding enumeration operators (English)

0 references

publication date

16 December 2022

0 references

zbMATH Keywords

computability

0 references

computable structure theory

0 references

enumeration operators

0 references

essential lowness

0 references

Hilbert's tenth problem

0 references

Russell G. Miller

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-51466-2_10

0 references

As easy as $\mathbb {Q}$: Hilbert’s Tenth Problem for subrings of the rationals and number fields

0 references

0 references

The Hilbert's-tenth-problem operator

0 references

0 references

<i>d</i>-computable categoricity for algebraic fields

0 references

An introduction to computable model theory on groups and fields

0 references

Baire Category Theory and Hilbert’s Tenth Problem Inside $$\mathbb {Q}$$ Q

0 references

MEASURE THEORY AND HILBERT’S TENTH PROBLEM INSIDE ℚ

0 references

Isomorphism and classification for countable structures

0 references

HTP-COMPLETE RINGS OF RATIONAL NUMBERS

0 references

Categoricity properties for computable algebraic fields

0 references

0 references

Decidability of the “almost all” theory of degrees

0 references

Identifiers

10.1007/978-3-030-51466-2_10

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2106596

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2106596&oldid=37472624"