Primitive recursive decidability for large rings of algebraic integers

MaRDI QIDQ4626569zbMATH OpenFDO

Authors Aharon Razon

Publication date 28 February 2019

Full work available at URL http://albanian-j-math.com/archives/2019-01.pdf

zbMATH Keywords

Galois stratificationprimitive recursive decidabilityPAC field over a subring

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Field arithmetic (12E30) Decidability and field theory (12L05)

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

(9)

• scientific article; zbMATH DE number 5901621 (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}\)
• scientific article; zbMATH DE number 1916517 (Why is no real title available?)
• Weighted greatest common divisors and weighted heights
• Decidable algebraic fields
• UNDECIDABILITY OF FAMILIES OF RINGS OF TOTALLY REAL INTEGERS
• Decidability of the rings of real algebraic and p-adic algebraic integers.
• The elementary theory of e-free PAC domains

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)