Pages that link to "Item:Q4382476"
From MaRDI portal
The following pages link to Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem (Q4382476):
Displaying 12 items.
- Undecidability of the word problem for Yamamura's HNN-extension under nice conditions. (Q305764) (← links)
- Cobham's theorem for substitutions (Q645357) (← links)
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable (Q1202930) (← links)
- The definable criterion for definability in Presburger arithmetic and its applications. (Q1401169) (← links)
- Defining Multiplication in Some Additive Expansions of Polynomial Rings (Q2813650) (← links)
- Automatic Sets of Rational Numbers (Q2947958) (← links)
- Some proofs of undecidability of arithmetic (Q3237141) (← links)
- (Q3320374) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- A Uniformly, Extremely Nonextensional Formula of Arithmetic with many Undecidable Fixed Points in many Theories (Q3677758) (← links)
- (Q3691669) (← links)
- A list of arithmetical structures complete with respect to the first-order definability (Q5941257) (← links)