Pages that link to "Item:Q1401169"
From MaRDI portal
The following pages link to The definable criterion for definability in Presburger arithmetic and its applications. (Q1401169):
Displaying 15 items.
- Recurrence along directions in multidimensional words (Q785801) (← links)
- Semi-synchronous transductions (Q1006891) (← links)
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534) (← links)
- Minimal automaton for multiplying and translating the Thue-Morse set (Q2040011) (← links)
- Lattice of definability in the order of rational numbers (Q2197237) (← links)
- Structural Presburger digit vector automata (Q2378536) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- Defining Multiplication in Some Additive Expansions of Polynomial Rings (Q2813650) (← links)
- Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order (Q2988842) (← links)
- A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS (Q3643584) (← links)
- (Q5009704) (← links)
- (Q5020521) (← links)
- (Q5227519) (← links)
- Decidability of Definability Issues in the Theory of Real Addition (Q5880942) (← links)
- The lattice of definability: origins, recent developments, and further directions (Q6132481) (← links)
