Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Myhill (1955)
Creative setsZ. Math. Logik Grundl. Math., 1
M.O. Rabin (1969)
Decidability of second-order theories and automata on infinite treesTransactions AMS, 141
M. Rabin (1972)
Automata on Infinite Objects and Church's Problem
J. Robinson (1949)
Definability and decision problems in arithmeticJournal of Symbolic Logic, 14
R. Robinson (1958)
Restricted set-theoretical definitions in arithmetic, 9
J.R. Büchi, D. Siefkes (1973)
Decidable theories II: The monadic second order theory of all countable ordinals
D. Siefkes (1970)
Büchi's monadic second order successor arithmetic
E. Specker (1957)
Eine Verschärfung des Unvollständigkeitssatzes des ZahlentheorieBull. Acad. Pol. Sci., Cl. III, 5
J. Büchi, Lawrence Landweber (1969)
Definability in the monadic second-order theory of successorJournal of Symbolic Logic, 34
D. Siefkes (1970)
Decidable theories I: Büchi's monadic second order successor arithmetic
M. Rabin (1968)
Decidability of second-order theories and automata on infinite treesBulletin of the American Mathematical Society, 74
R. McNaughton (1966)
Testing and Generating Infinite Sequences by a Finite AutomatonInf. Control., 9
Archive for Mathematical Logic – Springer Journals
Published: Nov 27, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.