Narrow your search

Library

AP (1)

KBC (1)

KDG (1)

KU Leuven (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLL (1)

UGent (1)

ULB (1)

More...

Resource type

book (2)

digital (1)


Language

English (2)


Year
From To Submit

2023 (2)

Listing 1 - 2 of 2
Sort by

Book
Field Arithmetic
Authors: ---
ISBN: 3031280202 3031280199 Year: 2023 Publisher: Cham : Springer Nature Switzerland : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book uses algebraic tools to study the elementary properties of classes of fields and related algorithmic problems. The first part covers foundational material on infinite Galois theory, profinite groups, algebraic function fields in one variable and plane curves. It provides complete and elementary proofs of the Chebotarev density theorem and the Riemann hypothesis for function fields, together with material on ultraproducts, decision procedures, the elementary theory of algebraically closed fields, undecidability and nonstandard model theory, including a nonstandard proof of Hilbert's irreducibility theorem. The focus then turns to the study of pseudo algebraically closed (PAC) fields, related structures and associated decidability and undecidability results. PAC fields (fields K with the property that every absolutely irreducible variety over K has a rational point) first arose in the elementary theory of finite fields and have deep connections with number theory. This fourth edition substantially extends, updates and clarifies the previous editions of this celebrated book, and includes a new chapter on Hilbertian subfields of Galois extensions. Almost every chapter concludes with a set of exercises and bibliographical notes. An appendix presents a selection of open research problems. Drawing from a wide literature at the interface of logic and arithmetic, this detailed and self-contained text can serve both as a textbook for graduate courses and as an invaluable reference for seasoned researchers.


Multi
Field Arithmetic
Authors: ---
ISBN: 9783031280207 9783031280191 9783031280214 9783031280221 Year: 2023 Publisher: Cham Springer Nature

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book uses algebraic tools to study the elementary properties of classes of fields and related algorithmic problems. The first part covers foundational material on infinite Galois theory, profinite groups, algebraic function fields in one variable and plane curves. It provides complete and elementary proofs of the Chebotarev density theorem and the Riemann hypothesis for function fields, together with material on ultraproducts, decision procedures, the elementary theory of algebraically closed fields, undecidability and nonstandard model theory, including a nonstandard proof of Hilbert's irreducibility theorem. The focus then turns to the study of pseudo algebraically closed (PAC) fields, related structures and associated decidability and undecidability results. PAC fields (fields K with the property that every absolutely irreducible variety over K has a rational point) first arose in the elementary theory of finite fields and have deep connections with number theory. This fourth edition substantially extends, updates and clarifies the previous editions of this celebrated book, and includes a new chapter on Hilbertian subfields of Galois extensions. Almost every chapter concludes with a set of exercises and bibliographical notes. An appendix presents a selection of open research problems. Drawing from a wide literature at the interface of logic and arithmetic, this detailed and self-contained text can serve both as a textbook for graduate courses and as an invaluable reference for seasoned researchers.

Listing 1 - 2 of 2
Sort by