DeepAI AI Chat
Log In Sign Up

A strong version of Cobham's theorem

by   Philipp Hieronymi, et al.
University of Illinois at Urbana-Champaign

Let k,ℓ≥ 2 be two multiplicatively independent integers. Cobham's famous theorem states that a set X⊆ℕ is both k-recognizable and ℓ-recognizable if and only if it is definable in Presburger arithmetic. Here we show the following strengthening: let X⊆ℕ^m be k-recognizable, let Y⊆ℕ^m be ℓ-recognizable such that both X and Y are not definable in Presburger arithmetic. Then the first-order logical theory of (ℕ,+,X,Y) is undecidable. This is in contrast to a well-known theorem of Büchi that the first-order logical theory of (ℕ,+,X) is decidable.


page 1

page 2

page 3

page 4


Strategic Coalitions in Stochastic Games

The article introduces a notion of a stochastic game with failure states...

Incompleteness for stably computable formal systems

We prove, for stably computably enumerable formal systems, direct analog...

Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL

We have formalised Szemerédi's Regularity Lemma and Roth's Theorem on Ar...

Polarized Rewriting and Tableaux in B Set Theory

We propose and extension of the tableau-based first-order automated theo...

Gaussian width bounds with applications to arithmetic progressions in random settings

Motivated by two problems on arithmetic progressions (APs)---concerning ...

On the logical complexity of cyclic arithmetic

We study the logical complexity of proofs in cyclic arithmetic (CA), as ...

Towards Automated Let's Play Commentary

We introduce the problem of generating Let's Play-style commentary of ga...