# Infinite and Bi-infinite Words with Decidable Monadic Theories

@article{Kuske2018InfiniteAB,
title={Infinite and Bi-infinite Words with Decidable Monadic Theories},
author={Dietrich Kuske and J. Liu and Anastasia Moskvina},
journal={Log. Methods Comput. Sci.},
year={2018},
volume={14}
}
• Published 2018
• Computer Science, Mathematics
• Log. Methods Comput. Sci.
We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive $\omega$-words with decidable monadic second order theories is $\Sigma_3$-complete. (b) Known characterisations of the $\omega$-words with decidable monadic second order theories are transfered to the corresponding question for bi-infinite words. (c) We show that… Expand
1 Citations

#### Topics from this paper

Undecidability of MSO+"ultimately periodic"
• Mathematics, Computer Science
• ArXiv
• 2018
We prove that MSO on $\omega$-words becomes undecidable if allowing to quantify over sets of positions that are ultimately periodic, i.e, sets $X$ such that for some positive integer $p$, ultimatelyExpand

#### References

SHOWING 1-10 OF 26 REFERENCES
The Monadic Theory of Morphic Infinite Words and Generalizations
• Mathematics, Computer Science
• MFCS
• 2000
A large class of predicates P is exhibited such that the monadic theory MTh(N, <, P) is decidable, which unifies and extends the previously known examples. Expand
On decidability of monadic logic of order over the naturals extended by monadic predicates
It is shown that monadic second-order logic has the selection and the uniformization properties over the extensions of (Nat,<) by monadic predicates and a self-contained proof of this result is provided. Expand
On a Decision Method in Restricted Second Order Arithmetic
Let SC be the interpreted formalism which makes use of individual variables t, x, y, z,... ranging over natural numbers, monadic predicate variables q( ), r( ), s( ), i( ),... ranging over arbitraryExpand
Definability in the Monadic Second-Order Theory of Successor
• Mathematics, Computer Science
• J. Symb. Log.
• 1969
D is a relational system whereby D is a nonempty set and P i is an m i-ary relation on D and the (weak) monadic second-order theory (W)MT[D] consisting of the first-order predicate calculus with individual variables ranging over D; monadic predicate variablesranging over (finite) subsets of D; and constants corresponding to P 1, P 2, ⋯. Expand
Infinite words - automata, semigroups, logic and games
• Mathematics, Computer Science
• Pure and applied mathematics series
• 2004
The first manual devoted to Infinite Words explores all aspects of the theory, including Automata, Semigroups, Topology, Games, Logic, Bi-infinite Words, Infinite Trees and Finite Words. Expand
Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor
• Mathematics, Computer Science
• J. Symb. Log.
• 1966
In this chapter, certain first and second order theories which are semantically defined as the sets of all sentences true in certain given structures are studied. Expand
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
• Mathematics, Computer Science
• CSL
• 2006
Two characterizations of the decidable theories of this form are given, in terms of effectiveness conditions on two types of “homogeneous sets”, and it is shown that the first-order theory of successor with extra predicates is not covered by this approach. Expand
Recursively enumerable sets and degrees
TABLE OF CONTENTS Introduction Chapter I. The relation of the structure of an r.e. set to its degree. 1. Post's program and simple sets. 2. Dominating functions and quotient lattices. 3. Maximal setsExpand
Recursively enumerable sets and degrees - a study of computable functions and computability generated sets
• R. Soare
• Computer Science
• Perspectives in mathematical logic
• 1987
The author has managed to give a coherent exposition of a rather complex and messy area of logic, and with this book degree-theory is far more accessible to students and logicians in other fields than it used to be. Expand
LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
In this paper the author studies the decision problem for logical languages intended to describe the properties of one-place functions on the set of natural numbers. For functions taking a finiteExpand