This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Büchi J.R.: On a decision method in restricted second order arithmetic. Proc. 1960 Intern. Congr. for Logic, Methodol. and Philos. of Sci., Stanford, 1962,pp. 1–11.
Büchi J.R.: Weak second-order arithmetic and finite automata. Z.Math. Logik und Grundl. Math. 6(1960), No 1, pp. 66–92.
Elgot C.C., Rabin M.O.: Decidability and undecidability of extentions of second (first) order theory of (generalized) successor. J. Symbolic Logic 31(1966), No 2, pp. 169–181.
Gurevich Yu., Harrington L.: Trees, automata and games. Proc. ACM STOC, May 1982, pp. 60–65.
Hedlund G.A.: Endomorphisms and automorphisms of the shift dynamical systems. Math. syst. theory 3(1971), No 4, pp. 320–375.
Jacobs K.: Maschinenerzeugte 0-1-Folgen, Selecta Mathematica, II, Springer-Verlag, 1970.
Мучник Ан. А. [Muchnik An.A.]: Игры на бесконечных деревьях и автоматы с тупиками. Новое докаэательство раэрешимости монадической теории нескольких следований. [Games on infinite trees and automata with deadends. A new proof of the decidability for the monadic theory of several successors.] Semiotica i Informatica 1984 (to appear).
Мучник Ан.А. [Muchnik An.A.]: Новое докаэательство теоремы шютценберже о моноидах беэ нетривиальных подгрупп. [A new proof of Schützenberger's theorem on monoids without nontrivial subgroups.] Matematicheskaia logika, mat. lingvistika i teoria algoritmov. Kalinin 1983, pp. 65–68.
McNaughton R.: Rev. of [B2]. J. Symb. Logic 28(1983) No2, pp. 100–102.
Rabin M.O.: Decidability of second-order theories and automata on infinite trees. Transactions AMS 141(1969), pp. 1–35.
Rabin M.O.: Automata on infinite objects and Church's problem. AMS, Providence, 1972.
Siefkes D.: Decidable extentions of monadic second order successor arithmetic. Automatentheorie un Formale Sprachen, Mannheim, 1969, pp. 441–472.
Siefkes D.: Undecidable extentions of monadic second order successor arithmetic. Z. Math. Logik und Grundlagen der Mathematik 17(1971), No 5, pp. 383–394.
Siefkes D.: The recursive sets in certain monadic second order fragments of arithmetic. Arch. Math. Logik, 17(1975), No 1–2, pp. 71–80.
Семенов А.Л. [Semenov A.L.]: О некоторых расширениях ариφметикы сложения натуральных чисел. [On certain extensions of the arithmetic of addition of natural numbers.] Iz. Akad. Nauk SSSR 43(1979), No 5, pp. 1175–1195; Math. USSR-Izv. 15(1980), No 2, pp. 401–418.
Семенов А.Л. [Semenov A.L.]: Логические теории одноместных φункций на натуральном ряде. [Logical theories of unary functions on natural numbers.] Izv. Akad. Nauk SSSR 47(1983), No 3, pp. 623–658.
Shelah S.: The monadic theory of order. Annals of Math. 102 (1975), pp. 379–419.
Thomas W.: A note on undecidable extentions of monadic second order arithmetic. Z. Math. Logik und Grundlagen Math. 17 (1975), No 1–2, pp. 43–44.
Thomas W.: A combinatorial approach to the theory of ω-automata. Information and Control 48(1981), pp. 261–283.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Semenov, A.L. (1984). Decidability of monadic theories. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030296
Download citation
DOI: https://doi.org/10.1007/BFb0030296
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive