Imagen de Portada

Computability in infinite Galois theory and algorithmically random algebraic fields

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Calvert, Wesley, Harizanov, Valentina, Shlapentokh, Alexandra
Formato:	Preprint
Publicado:	2023
Materias:	Logic Number Theory 03C57, 03D45, 11u39, 03D32
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Cohesive Products of Fields
por: Dimitrov, Rumen, et al.
Publicado: (2026)

Isomorphism Spectra and Computably Composite Structures
por: Lakerdas-Gayle, Joey
Publicado: (2025)

Online and feasible presentability: from trees to modal algebras
por: Bazhenov, Nikolay, et al.
Publicado: (2025)

Computability for tree presentations of continuum-size structures
por: Block, Jason, et al.
Publicado: (2025)

A non-computable c.e. closed subset of $[0,1]$
por: Badaev, Serikzhan, et al.
Publicado: (2025)

On the computability of cofinal Fraïssé limits
por: Ackerman, Nathanael, et al.
Publicado: (2026)

Scott sentence complexities of linear orderings
por: Gonzalez, David, et al.
Publicado: (2023)

Introenumerability, autoreducibility, and randomness
por: Li, Ang
Publicado: (2024)

Extensions of categoricity relative to a degree
por: Villano, Java Darleen
Publicado: (2025)

New definitions in the theory of Type 1 computable topological spaces
por: Rauzy, Emmanuel
Publicado: (2023)

Normality, Relativization, and Randomness
por: Calvert, Wesley, et al.
Publicado: (2023)

Algorithmic aspects of left-orderings of solvable Baumslag--Solitar groups via its dynamical realization
por: Ho, Meng-Che "Turbo", et al.
Publicado: (2024)

On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
por: Song, Sirun, et al.
Publicado: (2025)

$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
por: Cintioli, Patrizio
Publicado: (2026)

Definable Galois theory for bimeromorphic geometry
por: Moosa, Rahim, et al.
Publicado: (2025)

A generalization of Markov's approach to the continuity problem for Type 1 computable functions
por: Rauzy, Emmanuel
Publicado: (2023)

Benign approximations and non-speedability
por: Hölzl, Rupert, et al.
Publicado: (2023)

Randomness versus superspeedability
por: Hölzl, Rupert, et al.
Publicado: (2024)

Strong reducibilities and set theory
por: Schweber, Noah
Publicado: (2024)

Effective Completeness for S4.3.1-Theories with Respect to Discrete Linear Models
por: Nichols, David
Publicado: (2017)

Undecidability of infinite towers of Kummer extensions of $\mathbb{F}_p(t)$
por: Martinez-Ranero, Carlos, et al.
Publicado: (2024)

Undecidability of infinite algebraic extensions of $\mathbb{F}_p(t)$
por: Martinez-Ranero, Carlos, et al.
Publicado: (2024)

Regainingly approximable numbers and sets
por: Hertling, Peter, et al.
Publicado: (2023)

Externally definable fsg groups in NIP theories
por: Chernikov, Artem
Publicado: (2025)

Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
por: Hertling, Peter, et al.
Publicado: (2025)

Finitely Bounded Homogeneity Turned Inside-Out
por: Rydval, Jakub
Publicado: (2021)

Automatic structures and the problem of natural well-orderings
por: Beklemishev, Lev D., et al.
Publicado: (2024)

Mixed quantifier prefixes over Diophantine equations with integer variables
por: Sun, Zhi-Wei
Publicado: (2021)

A Counterexample Regarding C.E. Closed Subsets of [0,1] Under Homeomorphisms
por: Bosserhoff, Volker
Publicado: (2025)

Paths, Ends and The Separation Problem for Infinite Graphs
por: Carrasco-Vargas, Nicanor, et al.
Publicado: (2024)

Definability of complex functions in o-minimal structures
por: Padgett, Adele, et al.
Publicado: (2025)

Analysis of HOD for Admissible Structures
por: Kruschewski, Jan, et al.
Publicado: (2025)

Computable vs Descriptive Combinatorics of Local Problems on Trees
por: Weilacher, Felix
Publicado: (2022)

Possibility Semantics
por: Holliday, Wesley H.
Publicado: (2024)

Computable Gelfand Duality
por: Burton, Peter, et al.
Publicado: (2024)

On the learning power of Friedman-Stanley jumps
por: Cipriani, Vittorio, et al.
Publicado: (2025)

On a Conjecture Regarding the Mouse Order for Weasels
por: Kruschewski, Jan, et al.
Publicado: (2022)

Intuitionistic Sahlqvist theory for deductive systems
por: Fornasiere, Damiano, et al.
Publicado: (2022)

Undecidability on Diophantine equations over $\mathbb Z[i]$ with $20$ unknowns
por: Matiyasevich, Yuri, et al.
Publicado: (2025)

Terminal Absoluteness of Collapse Forcings
por: Straffelini, Cesare
Publicado: (2025)