Primitive recursive decidability for large rings of algebraic integers
From MaRDI portal
Recommendations
- PRIMITIVE RECURSIVE DECIDABILITY FOR THE RING OF INTEGERS OF THE COMPOSITUM OF ALL SYMMETRIC EXTENSIONS OF ℚ
- The elementary theory of e-free PAC domains
- Decidable Sentences Over Polynomial Rings
- Decidable algebraic fields
- First-order decidability and definability of integers in infinite algebraic extensions of the rational numbers
Cited in
(10)- The logic of pseudo-\(S\)-integers
- The elementary theory of e-free PAC domains
- Weighted greatest common divisors and weighted heights
- scientific article; zbMATH DE number 5901621 (Why is no real title available?)
- Decidability of the rings of real algebraic and p-adic algebraic integers.
- scientific article; zbMATH DE number 1916517 (Why is no real title available?)
- Decidable algebraic fields
- UNDECIDABILITY OF FAMILIES OF RINGS OF TOTALLY REAL INTEGERS
- 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}\)
This page was built for publication: Primitive recursive decidability for large rings of algebraic integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626569)