The Structure of Models of Decidable Monadic Theories of Graphs
نویسنده
چکیده
منابع مشابه
On countable chains having decidable monadic theory
Rationals and countable ordinals are important examples of structures with decidable monadic second-order theories. A chain is an expansion of a linear order by monadic predicates. We show that if the monadic second-order theory of a countable chain C is decidable then C has a non-trivial expansion with decidable monadic second-order theory.
متن کاملOn Internal Presentation of Regular Graphs
The study of innnite graphs has potential applications in the spec-iication and veriication of innnite systems and in the transformation of such systems. Preexxrecognizable graphs and regular graphs are of particular interest in this area since their monadic seconddorder theories are decidable. Although the latter form a proper subclass of the former, no characterization of regular graphs withi...
متن کاملOn Monadic Theories of Monadic Predicates
Pioneers of logic, among them J.R. Büchi, M.O. Rabin, S. Shelah, and Y. Gurevich, have shown that monadic second-order logic offers a rich landscape of interesting decidable theories. Prominent examples are the monadic theory of the successor structure S1 = (N,+1) of the natural numbers and the monadic theory of the binary tree, i.e., of the two-successor structure S2 = ({0, 1} ∗, ·0, ·1). We c...
متن کاملModel Transformations in Decidability Proofs for Monadic Theories
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (given for example by the restriction to formulas of a certain quantifier rank) and – depending on the fragment – reduces the model under consideration to a simpler one. In the second approach, one applies a global tran...
متن کاملInfinite and Bi-infinite Words with Decidable Monadic Theories
We study word structures of the form (D,<,P ) where D is either N or Z, < is the natural linear ordering on D and P ⊆ D is a predicate on D. In particular we show: (a) The set of recursive ω-words with decidable monadic second order theories is Σ3complete. (b) Known characterisations of the ω-words with decidable monadic second order theories are transfered to the corresponding question for bi-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 53 شماره
صفحات -
تاریخ انتشار 1991