View in EDS PDF Full Text

Computability in infinite Galois theory and algorithmically random algebraic fields.

Saved in:
Bibliographic Details
Title: Computability in infinite Galois theory and algorithmically random algebraic fields.
Authors: Calvert, Wesley1 (AUTHOR) wcalvert@siu.edu, Harizanov, Valentina2 (AUTHOR), Shlapentokh, Alexandra3 (AUTHOR)
Source: Journal of the London Mathematical Society. Nov2024, Vol. 110 Issue 5, p1-26. 26p.
Database: Mathematics Source
Description
ISSN:00246107
DOI:10.1112/jlms.70017