QUANTIFIER ELIMINATION FOR LEXICOGRAPHIC PRODUCTS OF ORDERED ABELIAN GROUPS

被引:3
|
作者
Ibuka, Shingo [1 ]
Kikyo, Hirotaka [1 ]
Tanaka, Hiroshi [2 ]
机构
[1] Kobe Univ, Grad Sch Engn, 1-1 Rokkodai, Kobe, Hyogo 6578501, Japan
[2] Anan Natl Coll Technol, Tokushima 7740017, Japan
关键词
ordered abelian groups; quantifier elimination;
D O I
10.21099/tkbjm/1251833209
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let L-ag = {+, -, 0} be the language of the abelian groups, L an expansion of L-ag(<) by relations and constants, and L-mod = L-ag boolean OR {equivalent to(n)}(n >= 2) where each equivalent to(n) is defined as follows: x equivalent to(n) y if and only if n vertical bar x - y. Let H be a structure for L such that H vertical bar L-ag (<) is a totally ordered abelian group and K a totally ordered abelian group. We consider a product interpretation of H x K with a new predicate I for {0} x K defined by N. Suzuki [9]. Suppose that H admits quantifier elimination in L. 1. If K is a Presburger arithmetic with smallest positive element 1(K) then the product interpretation G of H x K with a new predicate I admits quantifier elimination in L(I, 1) boolean OR L-mod with 1(G) = (0(H), K-1). 2. If K is dense regular and K/nK is finite for every integer n >= 2 then the product interpretation G of H x K with a new predicate I admits quantifier elimination in L(I, D) boolean OR L-mod for some set D of constant symbols where G vertical bar= I (d) for each d is an element of D. 3. If K admits quantifier elimination in L-mod (<, D) for some set D of constant symbols then the product interpretation G of H X K with a new predicate I admits quantifier elimination in L(I, d) boolean OR L-mod unless K is dense regular with K/nK being infinite for some n. Conversely, if the product interpretation G of H x K with a new predicate I admits quantifier elimination in L(I, D) boolean OR L-mod for some set D of constant symbols such that G vertical bar= I (d) for each d is an element of D then H admits quantifier elimination in L boolean OR L-mod, and K admits quantifier elimination in L-mod (<, D). We also discuss the axiomatization of the theory of the product interpretation of H x K.
引用
收藏
页码:95 / 129
页数:35
相关论文
共 50 条
  • [21] Lower Bounds for RAMs and Quantifier Elimination
    Ajtai, Miklos
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 803 - 812
  • [22] Non-effective quantifier elimination
    Prunescu, M
    MATHEMATICAL LOGIC QUARTERLY, 2001, 47 (04) : 557 - 561
  • [23] On the combinatorial and algebraic complexity of quantifier elimination
    Basu, S
    Pollack, R
    Roy, MF
    JOURNAL OF THE ACM, 1996, 43 (06) : 1002 - 1045
  • [24] Infinite lexicographic products
    Meir, Nadav
    ANNALS OF PURE AND APPLIED LOGIC, 2022, 173 (01)
  • [25] Reduction and quantifier elimination techniques for program validation
    Bodeveix, JP
    Filali, M
    FORMAL METHODS IN SYSTEM DESIGN, 2002, 20 (01) : 69 - 89
  • [26] A Poly-algorithmic Approach to Quantifier Elimination
    Davenport, James H.
    Tonks, Zak P.
    Uncu, Ali K.
    2023 25TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, SYNASC 2023, 2023, : 44 - 51
  • [27] The Complexity of Quantifier Elimination and Cylindrical Algebraic Decomposition
    Brown, Christopher W.
    Davenport, James H.
    ISSAC 2007: PROCEEDINGS OF THE 2007 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2007, : 54 - 60
  • [28] Variant Real Quantifier Elimination: Algorithm and Application
    Hong, Hoon
    El Din, Mohab Safey
    ISSAC2009: PROCEEDINGS OF THE 2009 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2009, : 183 - 190
  • [29] SEPARABLY CLOSED VALUED FIELDS: QUANTIFIER ELIMINATION
    Hong, Jizhan
    JOURNAL OF SYMBOLIC LOGIC, 2016, 81 (03) : 887 - 900
  • [30] Quantifier elimination for a class of exponential polynomial formulas
    Xu, Ming
    Li, Zhi-Bin
    Yang, Lu
    JOURNAL OF SYMBOLIC COMPUTATION, 2015, 68 : 146 - 168