On Interpretations of Presburger Arithmetic in Buchi Arithmetics

被引:0
|
作者
Zapryagaev, A. A. [1 ]
机构
[1] Natl Res Univ Higher Sch Econ, Moscow, Russia
关键词
formal arithmetics; interpretations; automatic structures; automatic abelian groups;
D O I
10.1134/S1064562423700655
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Buchi arithmetics BA(n), n >= 2, are extensions of Presburger arithmetic with an unary functional symbol V-n(x) denoting Presburger arithmetic the largest power of n that divides x. Definability of a set in BA(n) is equivalent to its recognizability by a finite automaton receiving numbers in their n-ary expansion. We consider the interpretations of in the standard model of BA(n) and show that each such interpretation has an internal model isomorphic to the standard one. This answers a question by A. Visser on the interpretations of certain weak arithmetical theories in themselves.
引用
收藏
页码:89 / 92
页数:4
相关论文
共 50 条
  • [41] Quantifier elimination for counting extensions of Presburger arithmetic
    Chistikov, Dmitry
    Haase, Christoph
    Mansutti, Alessio
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2022), 2022, 13242 : 225 - 243
  • [42] Detection of infeasible paths using Presburger arithmetic
    Naoi, Kuniaki
    Takahashi, Naohisa
    Systems and Computers in Japan, 1999, 30 (09) : 74 - 87
  • [43] Detection of infeasible paths using presburger arithmetic
    Naoi, K
    Takahashi, N
    TWENTIETH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE (COMPSAC'96), PROCEEDINGS, 1996, 20 : 461 - 469
  • [44] Pliant Arithmetics and Pliant Arithmetic Operations
    Dombi, Jozsef
    ACTA POLYTECHNICA HUNGARICA, 2009, 6 (05) : 19 - 49
  • [45] Bounding quantification in parametric expansions of Presburger arithmetic
    John Goodrick
    Archive for Mathematical Logic, 2018, 57 : 577 - 591
  • [46] Fast and succinct population protocols for Presburger arithmetic
    Czerner, Philipp
    Guttenberg, Roland
    Helfrich, Martin
    Esparza, Javier
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2024, 140
  • [47] Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
    Haase, Christoph
    PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
  • [48] FPL: Fast Presburger Arithmetic through Transprecision
    Pitchanathan, Arjun
    Ulmann, Christian
    Weber, Michel
    Hoefler, Torsten
    Grosser, Tobias
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2021, 5 (OOPSLA):
  • [49] Complexity of Presburger arithmetic with fixed quantifier dimension
    Schöning U.
    Theory of Computing Systems, 1997, 30 (4) : 423 - 428
  • [50] Multiple counters automata, safety analysis and presburger arithmetic
    Comon, H
    Jurski, Y
    COMPUTER AIDED VERIFICATION, 1998, 1427 : 268 - 279