The definable criterion for definability in Presburger arithmetic and its applications.
type: Item
instance of: scholarly article
title: The definable criterion for definability in Presburger arithmetic and its applications.
zbMATH Open document ID: 1052.68079
DOI: 10.1016/S0304-3975(02)00047-6
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03F30
zbMATH DE Number: 1965218
zbMATH Keywords: Definability
zbMATH Keywords: Presburger arithmetic
zbMATH Keywords: Cobham-Semenov theorem
Wikidata QID: Q56059273
author: Andrej Muchnik
MaRDI profile type: Publication
cites work: Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
cites work: Logic and \(p\)-recognizable sets of integers
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: On the base-dependence of sets of numbers recognizable by finite automata
cites work: Cobham's Theorem seen through Büchi's Theorem
cites work: Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
cites work: Q4147966
cites work: Some results in the effective descriptive set theory
full work available at URL: s0304-3975(02)00047-6
OpenAlex ID: W1998927893
description: scientific article; zbMATH DE number 1965218