Weak monadic second order theory of succesor is not elementary-recursive
Part of the Lecture Notes in Mathematics book series (LNM, volume 453)
- 385 Downloads
KeywordsTuring Machine Decision Procedure Order Theory Finite Automaton Input Word
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 3.Büchi, J.R. and C.C. Elgot, Decision problems of weak second order arithmetics and finite automata, Part I, (abstract), AMS Notices, 5 (1959), 834.Google Scholar
- 5.Cooper, D.C. Theorem-proving in arithmetic without multiplication, Computer and Logic Group Memo. No. 16, U.C. of Swansea, April, 1972, to appear in Machine Intelligence 7.Google Scholar
- 7.Ferrante, J. and C. Rackoff, A decision procedure for the first order theory of real addition with order, Project MAC Tech. Memo 33, Mass. Inst. of Technology (May, 1973), 16pp., to appear SIAM Jour. Comp. Google Scholar
- 9.Meyer, A.R. Weak SIS cannot be decided (abstract 72T-E67), AMS Notices, 19, 5 (August, 1972), p. A-598.Google Scholar
- 10.Meyer, A.R. and L.J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, 13 th Switching and Automata Theory Symp. (Oct. 1972), IEEE, 125–129.Google Scholar
- 11.Oppen, D.C. Elementary bounds for Presburger arithmetic, 5 th ACM Symp. Theory of Computing (April, 1973), 34–37.Google Scholar
- 15.Stearns, R.E., J. Hartmanis, and P.M. Lewis, III, Hierarchies of memory-limited computations, 6 th Switching Theory and Logical Design Symp. (1965), IEEE, 179–190.Google Scholar
- 16.Stockmeyer, L.J. and A.R. Meyer, Word problems requiring exponential time, 5 th ACM Symp. Theory of Computing (April, 1973), 1–9.Google Scholar
© Springer-Verlag Berlin · Heidelberg 1975