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 条
  • [21] Definable groups in models of Presburger Arithmetic
    Onshuus, Alf
    Vicaria, Mariana
    ANNALS OF PURE AND APPLIED LOGIC, 2020, 171 (06)
  • [22] PRESBURGER ARITHMETIC WITH ALGEBRAIC SCALAR MULTIPLICATIONS
    Hieronymi, Philipp
    Nguyen, Danny
    Pak, Igor
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (03) : 4:1 - 4:34
  • [23] TaPAS: The Talence Presburger Arithmetic Suite
    Leroux, Jerome
    Point, Gerald
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2009, 5505 : 182 - 185
  • [24] Deciding Boolean Algebra with Presburger Arithmetic
    Viktor Kuncak
    Huu Hai Nguyen
    Martin Rinard
    Journal of Automated Reasoning, 2006, 36 : 213 - 239
  • [25] On the automata size toy Presburger arithmetic
    Klaedtke, F
    19TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2004, : 110 - 119
  • [26] Expansions of Presburger arithmetic with the exchange property
    Mariaule, Nathanael
    MATHEMATICAL LOGIC QUARTERLY, 2021, 67 (04) : 409 - 419
  • [27] Presburger Buchi Tree Automata with Applications to Logics with Expressive Counting
    Bednarczyk, Bartosz
    Fiuk, Oskar
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2022, 2022, 13468 : 295 - 308
  • [28] Bounds on the automata size for Presburger arithmetic
    Klaedtke, Felix
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2008, 9 (02)
  • [29] Succinct Population Protocols for Presburger Arithmetic
    Blondin, Michael
    Esparza, Javier
    Genest, Blaise
    Helfrich, Martin
    Jaax, Stefan
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [30] On solving Presburger and linear arithmetic with SAT
    Strichman, O
    FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS, 2002, 2517 : 160 - 170