The definable criterion for definability in Presburger arithmetic and its applications

2003/01/01 by An. A. Muchnik, An.A. Muchnik · 1 citation
Computer Science · #Computability, Logic, AI Algorithms #Logic, programming, and type systems #semigroups and automata theory

paper · doi:10.1016/s0304-3975(02)00047-6

crossref issued 2003/01/01 · crossref published 2003/01/01 · crossref published-print 2003/01/01 · openalex publication_date 2003/01/01 · crossref created 2003/02/05 · crossref deposited 2019/05/01 · openalex created_date 2025/10/10 · crossref indexed 2026/06/04 · openalex updated_date 2026/07/23

Citations

• Presburgerness of predicates regular in two number systems
• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems

Cited by

• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
• Presburger arithmetic [wikipedia]