Decidable Theories of the Ordering of Natural Numbers with Unary Predicates Dedicated to Boris A. Trakhtenbrot on the occasion of his 85th birthday
Alexander Rabinovich1 and Wolfgang Thomas2 1
2
Tel Aviv University, Department of Computer Science
[email protected] RWTH Aachen, Lehrstuhl Informatik 7, 52056 Aachen, Germany
[email protected]
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order logic. Building on the modeltheoretic composition method of Shelah, we give two characterizations of the decidable theories of this form, in terms of effectiveness conditions on two types of “homogeneous sets”. We discuss the significance of these characterizations, show that the first-order theory of successor with extra predicates is not covered by this approach, and indicate how analogous results are obtained in the semigroup theoretic and the automata theoretic framework.
1
Introduction
In [1], B¨ uchi showed that the monadic theory of the ordering (N,
