First-order decidability and definability of integers in infinite algebraic extensions of the rational numbers

被引:0
|
作者
Alexandra Shlapentokh
机构
[1] East Carolina University,Department of Mathematics
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidabilitv. We also obtain a structural sufficient condition for definability of the ring of integers over its field of fractions. In particular, we show that the following propositions hold: (1) For any rational prime q and any positive rational integer m. algebraic integers are definable in any Galois extension of Q where the degree of any finite subextension is not divisible by qm. (2) Given a prime q, and an integer m > 0, algebraic integers are definable in a cyclotomic extension (and any of its subfields) generated by any set {ζpl|l∈Z>0,P≠q\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{ {\zeta _{{p^l}}}|l \in {Z_{ > 0,}}P \ne q$$\end{document} is any prime such that qm +1∧(p — 1)}. (3) The first-order theory of Any Abelina Extension of Q With Finitely Many Rational Primes is undecidable and rational integers are definable in these extensions.
引用
收藏
页码:579 / 633
页数:54
相关论文
共 50 条
  • [31] The decidability of the first-order theory of Knuth-Bendix order
    Zhang, T
    Sipma, HB
    Manna, Z
    AUTOMATED DEDUCTION - CADE-20, PROCEEDINGS, 2005, 3632 : 131 - 148
  • [32] Primitive recursive decidability for large rings of algebraic integers inside the compositum of all symmetric extensions of ℚ
    Aharon Razon
    Israel Journal of Mathematics, 2023, 257 : 575 - 590
  • [33] The Exact Complexity of the First-Order Logic Definability Problem
    Arenas, Marcelo
    Diaz, Gonzalo I.
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2016, 41 (02):
  • [34] Loop-separable programs and their first-order definability
    Chen, Yin
    Lin, Fangzhen
    Zhang, Yan
    Zhou, Yi
    ARTIFICIAL INTELLIGENCE, 2011, 175 (3-4) : 890 - 913
  • [36] First-order definability of trees and sparse random graphs
    Bohman, Tom
    Frieze, Alan
    Luczak, Tomasz
    Pikhurko, Oleg
    Smyth, Clifford
    Spencer, Joel
    Verbitsky, Oleg
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (03): : 375 - 400
  • [37] Rational general solutions of systems of first-order algebraic partial differential equations
    Grasegger, Georg
    Lastra, Alberto
    Sendra, Rafael
    Winkler, Franz
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2018, 331 : 88 - 103
  • [38] A SYNTACTIC PROOF OF THE DECIDABILITY OF FIRST-ORDER MONADIC LOGIC
    Orlandelli, Eugenio
    Tesi, Matteo
    BULLETIN OF THE SECTION OF LOGIC, 2024, 53 (02): : 223 - 244
  • [39] Formalization of Gaussian Integers, Gaussian Rational Numbers, and Their Algebraic Structures with Mizar
    Futa, Yuichi
    Mizushima, Daichi
    Okazaki, Hiroyuki
    2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012), 2012, : 591 - 595
  • [40] Decidability results in first-order hybrid Petri nets
    Balduzzi, F
    Di Febbraro, A
    Giua, A
    Seatzu, C
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2001, 11 (1-2): : 41 - 57