Decidable algebraic fields
From MaRDI portal
Publication:4977216
Abstract: We prove the following propositions. Theorem 1: Let be a subfield of a fixed algebraic closure of whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive (resp. primitive recursive) subfield . Theorem 2: For each positive integer there are infinitely many -tuples such that the field -- the fixed field of , is recursive in and its elementary theory is decidable. Moreover, is PAC and is isomorphic to the free profinite group on generators.
Recommendations
- Primitive recursive decidability for large rings of algebraic integers
- Definability and decidability in infinite algebraic extensions
- The elementary theory of e-free PAC domains
- Some undecidability results in strong algebraic languages
- Undecidability, unit groups, and some totally imaginary infinite extensions of \(\mathbb{Q}\)
Cites work
- Field Arithmetic
- Formally p-adic fields
- Galois stratification over Frobenius fields
- scientific article; zbMATH DE number 3935016 (Why is no real title available?)
- scientific article; zbMATH DE number 3730274 (Why is no real title available?)
- scientific article; zbMATH DE number 16857 (Why is no real title available?)
- scientific article; zbMATH DE number 46864 (Why is no real title available?)
- scientific article; zbMATH DE number 705075 (Why is no real title available?)
- scientific article; zbMATH DE number 233957 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- Mehrfach perfekte Körper
- Model Theory
- The elementary theory of algebraic fields of finite corank
- Théorème d'irréductibilité de Hilbert effectif
Cited in
(11)- Undecidability of some elementary theories over PAC fields
- Nondefinability of rings of integers in most algebraic fields
- Definability and decidability in infinite algebraic extensions
- Extensions of Hilbert's tenth problem: definability and decidability in number theory
- Decidable regularly closed fields of algebraic numbers
- Some undecidability results in strong algebraic languages
- Primitive recursive decidability for large rings of algebraic integers
- scientific article; zbMATH DE number 3999991 (Why is no real title available?)
- PRIMITIVE RECURSIVE DECIDABILITY FOR THE RING OF INTEGERS OF THE COMPOSITUM OF ALL SYMMETRIC EXTENSIONS OF ℚ
- Primitive recursive decidability for large rings of algebraic integers inside the compositum of all symmetric extensions of \(\mathbb{Q}\)
- The elementary theory of normal Frobenius fields
This page was built for publication: Decidable algebraic fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977216)