论文信息 - On the complexity of the isomorphism relation for fields of finite transcendence degree

On the complexity of the isomorphism relation for fields of finite transcendence degree

Abstract Confirming a conjecture of Hjorth and Kechris (Ann. Pure Appl. Logic 82 (1996) 221–272), we prove that the isomorphism relation for fields of finite transcendence degree is a universal essentially countable Borel equivalence relation. We also prove that the theory of fields of finite transcendence degree does not admit canonical models.

Simon Thomas | Boban Velickovic

[1] Alexander S. Kechris,et al. Countable sections for locally compact group actions , 1992, Ergodic Theory and Dynamical Systems.

[2] Harvey M. Friedman,et al. A Borel reductibility theory for classes of countable structures , 1989, Journal of Symbolic Logic.

[3] J. de Groot. Orthogonal isomorphic representations of free groups , 1956 .

[4] Simon Thomas,et al. On the Complexity of the Isomorphism Relation for Finitely Generated Groups , 1998 .

[5] R. J. Gardner,et al. THE BANACH‐TARSKI PARADOX (Encyclopedia of Mathematics and Its Applications, 24) , 1986 .

[6] R. Dougherty,et al. The structure of hy-per nite Borel equivalence relations , 1994 .

[7] A. Kechris. Classical descriptive set theory , 1987 .

[8] John P. Burgess. A selection theorem for group actions. , 1979 .

[9] Greg Hjorth,et al. Borel Equivalence Relations and Classifications of Countable Models , 1996, Ann. Pure Appl. Log..