Abstract
The formalism of regular expressions was introduced by S. C. Kleene [6] to obtain the following basic theorems.
The author wishes to thank Dr. J. B. Wright for many stimulating discussions. Some the results were announced in the Notices, American Mathematical Society. (Decision Problem Weak Second-Order Arithmetics and Finite Automata. Prelim. Report, Part I, Vol. 5, No December 1958.) This work was done on contract with the Office of Naval Research, Of fir of Ordnance Research, Army Signal Corps, and with the assistance of a grant from the Natioi Science Foundation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
Behmann, Heinrich, Beiträge zur Algebra der Logik, insbesondere zum Entschei dungs-problem. Math. Ann. 86, 163–229 (1922).
Burks, A. W., and Wright, J. B., Theory of Logical Nets. Proc. IRE, 41, 1357–1365 (1953).
Church, Alonzo, Application of Recursive Arithmetic to the Problem of Circuit Synthesis, Proceedings of the Cornell Logic Conference, Cornell University, 1957. Also see “Application of Recursive Arithmetic in the Theory of Computing and Automata”, Notes for a summer course, The University of Michigan, 1959.
Copi, I. M., Elgot, C. C., and Wright, J. B., Realization of Events by Logical Nets. Journal Ass. Comp. Mach. 5, pp. 181–196 (1958).
Gödel, Kurt, On undecidable propositions of formal mathematical systems. Notes by S. C. Kleene and Barkley Rosser on lectures at the Institute for Advanced Study, 1934. Mimeographed, Princeton, N. J., 30 pp.
Kleene, S. C., Representation of Events in Nerve Nets and Finite Automata. Automata Studies, Princeton University Press, 1956, 3–41.
Medvedev, I. T., On a Class of Events Representable in a Finite Automaton. MIT Lincoln Laboratory Group Report, 34–73, translated from the Russian by J. Schorr-Kon, June 30, 1958.
Myhill, John, Finite Automata and Representation of Events. WADC Report TR 57–624, Fundamental Concepts in the Theory of Systems, October, 1957, 112–137.
Moore, E. F., Gedanken-Experiments on Sequential Machines. Automata Studies, Princeton, 1956, 129–153.
Presburger, M., Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. Comptes-rendus du I Congres des Mathématiciens des Pays Slavs, Warsaw, 1930, 92–101, 395.
Putnam, H., Decidability and Essential Undecidability. Journ. Symb. Log. 22, 39–54. (1957)
Quine, W. V., Mathematical Logic. Harvard Univ. Press, Cambridge, 1947.
Rabin, M., and Scott, D., Finite Automata and Their Decision Problems. IBM Journal, April, 1959, 114–125.
Robinson, R. M., Restricted Set-Theoretical Definitions in Arithmetic. Proc. Am. Math. Soc. 9, 238–242 (1958).
Skolem, Thoralf, Untersuchungen über die Axiome des Klassenkalküls und über Produktions- und Summationsprobleme, welche gewisse Klassen von Aussagen betreffen. Skrifter utgit av Videnskapsselskapet i Kristiania, I. Mat.-nat. kl. 1919, No. 3, 37 pp.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Büchi, J.R. (1990). Weak Second-Order Arithmetic and Finite Automata. In: Mac Lane, S., Siefkes, D. (eds) The Collected Works of J. Richard Büchi. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8928-6_22
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8928-6_22
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8930-9
Online ISBN: 978-1-4613-8928-6
eBook Packages: Springer Book Archive