Pages that link to "Item:Q1202930"

The following pages link to The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable (Q1202930):

Displaying 14 items.

• A generalization of Cobham's theorem to automata over real numbers (Q1014642) (← links)
• Bertrand numeration systems and recognizability (Q1391295) (← links)
• Recognizable sets of power series over finite fields (Q1695187) (← links)
• Ostrowski numeration systems, addition, and finite automata (Q1750300) (← links)
• On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534) (← links)
• On the expressiveness of Büchi arithmetic (Q2233416) (← links)
• Defining Multiplication in Some Additive Expansions of Polynomial Rings (Q2813650) (← links)
• LOGICAL CHARACTERIZATION OF RECOGNIZABLE SETS OF POLYNOMIALS OVER A FINITE FIELD (Q2909094) (← links)
• EXPANSIONS OF THE ORDERED ADDITIVE GROUP OF REAL NUMBERS BY TWO DISCRETE SUBGROUPS (Q2976377) (← links)
• Automata Presenting Structures: A Survey of the Finite String Case (Q3503740) (← links)
• Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem (Q4382476) (← links)
• Cobham's Theorem seen through Büchi's Theorem (Q4630271) (← links)
• A list of arithmetical structures complete with respect to the first-order definability (Q5941257) (← links)