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 条
  • [21] General Solutions of First-Order Algebraic ODEs in Simple Constant Extensions
    Johann Josef Mitteramskogler
    Franz Winkler
    Journal of Systems Science and Complexity, 2023, 36 : 1769 - 1788
  • [22] General Solutions of First-Order Algebraic ODEs in Simple Constant Extensions
    MITTERAMSKOGLER Johann Josef
    WINKLER Franz
    Journal of Systems Science & Complexity, 2023, 36 (04) : 1769 - 1788
  • [23] General Solutions of First-Order Algebraic ODEs in Simple Constant Extensions
    Mitteramskogler, Johann Josef
    Winkler, Franz
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2023, 36 (04) : 1769 - 1788
  • [24] Comparing Calculi for First-Order Infinite-Valued ?ukasiewicz Logic and First-Order Rational Pavelka Logic
    Gerasimov, Alexander S.
    LOGIC AND LOGICAL PHILOSOPHY, 2023, 32 (02) : 269 - 318
  • [25] The complexity of definability by open first-order formulas
    Areces, Carlos
    Campercholi, Miguel
    Penazzi, Daniel
    Ventura, Pablo
    LOGIC JOURNAL OF THE IGPL, 2020, 28 (06) : 1093 - 1105
  • [26] Definability in first-order theories of graph orderings
    Ramanujam, R.
    Thinniyam, Ramanathan S.
    JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (01) : 403 - 420
  • [27] Deciding the existence of rational general solutions for first-order algebraic ODEs
    Thieu Vo, N.
    Grasegger, Georg
    Winkler, Franz
    JOURNAL OF SYMBOLIC COMPUTATION, 2018, 87 : 127 - 139
  • [28] Decidability Results in First-Order Epistemic Planning
    Liberman, Andres Occhipinti
    Rendsvig, Rasmus Kraemmer
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 4161 - 4167
  • [29] Complete first-order theories of some classical matrix groups over algebraic integers
    Myasnikov, Alexei G.
    Sohrabi, Mahmood
    JOURNAL OF ALGEBRA, 2021, 582 : 206 - 231
  • [30] About the combination of trees and rational numbers in a complete first-order theory
    Djelloul, K
    FRONTIERS OF COMBINING SYSTEMS, PROCEEDINGS, 2005, 3717 : 106 - 121