On the complexity of the isomorphism relation for fields of finite transcendence degree
From MaRDI portal
Publication:5939827
DOI10.1016/S0022-4049(00)00050-5zbMath0985.12004OpenAlexW2071085256MaRDI QIDQ5939827
Simon Thomas, Boban Velickovic
Publication date: 29 October 2001
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-4049(00)00050-5
Related Items (6)
The classification problem for torsion-free abelian groups of finite rank ⋮ Rotation equivalence and cocycle superrigidity ⋮ Classes of algebraic structures ⋮ Uncountable structures are not classifiable up to bi-embeddability ⋮ Classifying singularities up to analytic extensions of scalars is smooth ⋮ On the complexity of the classification problem for torsion-free abelian groups of rank two.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A selection theorem for group actions
- On the complexity of the isomorphism relation for finitely generated groups
- A Borel reductibility theory for classes of countable structures
- Orthogonal Isomorphic Representations Of Free Groups
- Countable sections for locally compact group actions
- The Structure of Hyperfinite Borel Equivalence Relations
- COUNTABLE BOREL EQUIVALENCE RELATIONS
- Borel equivalence relations and classifications of countable models
This page was built for publication: On the complexity of the isomorphism relation for fields of finite transcendence degree