TORSION-FREE ABELIAN GROUPS OF FINITE RANK AND FIELDS OF FINITE TRANSCENDENCE DEGREE

Abstract Let $\operatorname {TFAb}_r$ be the class of torsion-free abelian groups of rank r , and let $\operatorname {FD}_r$ be the class of fields of characteristic $0$ and transcendence degree r . We compare these classes using various notions. Considering the Scott complexity of the structures in the classes and the complexity of the isomorphism relations on the classes, the classes seem very similar. Hjorth and Thomas showed that the $\operatorname {TFAb}_r$ are strictly increasing under Borel reducibility. This is not so for the classes $\operatorname {FD}_r$ . Thomas and Velickovic showed that for sufficiently large r , the classes $\operatorname {FD}_r$ are equivalent under Borel reducibility. We try to compare the groups with the fields, using Borel reducibility, and also using some effective variants. We give functorial Turing computable embeddings of $\operatorname {TFAb}_r$ in $\operatorname {FD}_r$ , and of $\operatorname {FD}_r$ in $\operatorname {FD}_{r+1}$ . We show that under computable countable reducibility, $\operatorname {TFAb}_1$ lies on top among the classes we are considering. In fact, under computable countable reducibility, isomorphism on $\operatorname {TFAb}_1$ lies on top among equivalence relations that are effective $\Sigma _3$ .

Authors

Institutions

Publication Details

Journal
Journal of Symbolic Logic
Published
2025-02-13
DOI
https://doi.org/10.1017/jsl.2025.14
Primary Topic
Advanced Differential Equations and Dynamical Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

TORSION-FREE ABELIAN GROUPS OF FINITE RANK AND FIELDS OF FINITE TRANSCENDENCE DEGREE

Meng-Che Ho, Russell Miller, Julia F. Knight
Journal of Symbolic Logic
Advanced Differential Equations and Dynamical Systems
article

TORSION-FREE ABELIAN GROUPS OF FINITE RANK AND FIELDS OF FINITE TRANSCENDENCE DEGREE

Meng-Che Ho, Russell Miller, Julia F. Knight
article en

Abstract

Abstract Let $\operatorname {TFAb}_r$ be the class of torsion-free abelian groups of rank r , and let $\operatorname {FD}_r$ be the class of fields of characteristic $0$ and transcendence degree r . We compare these classes using various notions. Considering the Scott complexity of the structures in the classes and the complexity of the isomorphism relations on the classes, the classes seem very similar. Hjorth and Thomas showed that the $\operatorname {TFAb}_r$ are strictly increasing under Borel reducibility. This is not so for the classes $\operatorname {FD}_r$ . Thomas and Velickovic showed that for sufficiently large r , the classes $\operatorname {FD}_r$ are equivalent under Borel reducibility. We try to compare the groups with the fields, using Borel reducibility, and also using some effective variants. We give functorial Turing computable embeddings of $\operatorname {TFAb}_r$ in $\operatorname {FD}_r$ , and of $\operatorname {FD}_r$ in $\operatorname {FD}_{r+1}$ . We show that under computable countable reducibility, $\operatorname {TFAb}_1$ lies on top among the classes we are considering. In fact, under computable countable reducibility, isomorphism on $\operatorname {TFAb}_1$ lies on top among equivalence relations that are effective $\Sigma _3$ .

Journal of Symbolic Logic
University of Notre Dame (US), Queens College, CUNY (US), The Graduate Center, CUNY (US), California State University System (US)
Reduced inequalities
Openalex Percentile: Top 94%
Advanced Differential Equations and Dynamical Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.