# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Deciding whether a relation defined in Presburger logic can be defined in weaker logics. (English) Zbl 1158.03007
The author defines a structure ${\cal M}_2$ to be decidable in a structure ${\cal M}_1$ (for ${\cal M}_1$, ${\cal M}_2$ on the same domain and such that each basic relation of ${\cal M}_2$ is definable in ${\cal M}_1$) if it is decidable for a relation first-order definable in ${\cal M}_1$ whether it is first-order definable in ${\cal M}_2$. For ${\cal M}_1$ being Presburger arithmetic (both on $\Bbb N$ and $\Bbb Z$), he shows that all ${\cal M}_2$ built taking at least two of the three types of basic relations $(x\geq c)$, $(x-y\geq c)$ and $(x=b$ mod $a)$ are decidable in Presburger arithmetic.

##### MSC:
 03B25 Decidability of theories; sets of sentences 03B10 First-order logic 03D05 Automata theory in connection with logical questions 68Q45 Formal languages and automata
##### Keywords:
decidability; Presburger arithmetic; first-order logic
Full Text:
##### References:
 [1] O. Carton, C. Choffrut and S. Grigorieff. Decision problems for rational relations. RAIRO-Theor. Inf. Appl.40 (2006) 255-275. Zbl1112.03008 · Zbl 1112.03008 · doi:10.1051/ita:2006005 · numdam:ITA_2006__40_2_255_0 · eudml:92798 [2] C. Choffrut and M. Goldwurm. Timed automata with periodic clock constraints. J. Algebra Lang. Comput.5 (2000) 371-404. Zbl0964.68076 · Zbl 0964.68076 [3] S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press (1974). · Zbl 0317.94045 [4] S. Eilenberg and M.-P. Schützenbeger. Rational sets in commutative monoids. J. Algebra13 (1969) 173-191. Zbl0206.02703 · Zbl 0206.02703 · doi:10.1016/0021-8693(69)90070-2 [5] S. Ginsburg and E.H. Spanier. Bounded regular sets. Proc. Amer. Math. Soc. 17 (1966) 1043-1049. Zbl0147.25301 · Zbl 0147.25301 · doi:10.2307/2036087 [6] M. Koubarakis. Complexity results for first-order theories of temporal constraints. KR (1994) 379-390. [7] H. Läuchli and C. Savioz. Monadic second order definable relations on the binary tree. J. Symbolic Logic52 (1987) 219-226. · Zbl 0628.03005 · doi:10.2307/2273878 [8] A. Muchnik. Definable criterion for definability in presburger arithmentic and its application (1991). Preprint in russian. [9] P. Péladeau. Logically defined subsets of \Bbb N k . Theoret. Comput. Sci.93 (1992) 169-193. · Zbl 0747.03017 · doi:10.1016/0304-3975(92)90328-D [10] J.-E. Pin. Varieties of formal languages. Plenum Publishing Co., New-York (1986). (Traduction de Variétés de langages formels.) [11] J. Sakarovitch. Eléments de théorie des automates. Vuibert Informatique (2003). [12] A. Schrijver. Theory of Linear and Integer Programming. John Wiley & sons (1998). · Zbl 0970.90052 [13] C. Smoryński. Logical Number Theory I: An Introduction. Springer Verlag (1991). Zbl0759.03002 · Zbl 0759.03002