Abstract
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 arbitrary sets of natural numbers, the individual symbol 0 standing for zero, the function symbol ′ denoting the successor function, propositional connectives, and quantifiers for both types of variables. Thus SC is a fraction of the restricted second order theory of natural numbers, or of the first order theory of real numbers. In fact, if predicates on natural numbers are interpreted as binary expansions of real numbers, it is easy to see that SC is equivalent to the first order theory of [Re, +, Pw, Nn], whereby Re, Pw, Nn are, respectively, the sets of non-negative reals, integral powers of 2, and natural numbers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Büchi, J. R. “Weak Second Order Arithmetic and Finite Automata”, Zeitschrift für Math. Log. und Grundl. der Math., 6 (1960), pp. 66–92.
Church, Alonzo. “Application of Recursive Arithmetic to the Problem of Circuit Synthesis”, Notes of the Summer Institute of Symbolic Logic, Cornell, 1957, pp. 3–50,
Church, Alonzo. “Application of Recursive Arithmetic in the Theory of Computing and Automata”, Notes: Advanced Theory of the Logical Design of Digital Computers, U. of Michigan Summer Session, 1959.
Copi, I. M., C. Elgot, and J. B. Wright. “Realization of Events by Logical Nets”, Journal of the Association for Computing Machinery, Vol. 5, No. 2, April, 1958.
Friedman, Joyce. “Some Results in Church’s Restricted Recursive Arithmetic”, Journal of Symbolic Logic, 22, pp. 337–342 (1957).
Kleene, S. C. “Representation of Events in Nerve Nets and Finite Automata”, Automata Studies, Princeton University Press, 1956, pp. 3–41.
Myhill, John. “Finite Automata and Representation of Events”, WADC Report TR 57–624, Fundamental Concepts in the Theory of Systems, October 1957, pp. 112–137.
Putnam, Hillary. “Decidability and Essential Undecidability”, Journal of Symbolic Logic, 22 (1957), pp. 39–54.
Rabin, M., and D. Scott. “Finite Automata and their Decision Problems”, IBM Journal, April 1959, pp. 114–125.
Ramsey, F. P..“On a Problem of Formal Logic”, Proc. London Math. Soc., (2) 30 (1929), pp. 264–286.
Robinson, R. M. “Restricted Set-theoretical Definitions in Arithmetic”, Proc. Am. Math. Soc, 9 (1958), pp. 238–242.
Wang, Hao. “Circuit Synthesis by Solving Sequential Boolean Equations”, Zeitchrift für Math. Log. und Grundl. der Math., 5 (1959), pp. 291–322.
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). On a Decision Method in Restricted Second Order Arithmetic. 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_23
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8928-6_23
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