Exact complexity bounds for ordinal addition

Theoretical Computer Science

Volumn 165, Issue 2, 1996, Pages 247-273

  Maurin, Françoise ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; THEOREM PROVING;

TRANSFINITE AUTOMATA; WEAK SECOND ORDER THEORY;

FINITE AUTOMATA;

EID: 0346614645     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00221-9     Document Type: Article

References (13)

1. L. Berman, The complexity of logical theory, Theoret. Comput. Sci. 11 (1980) 71-77.
2. J.R. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Log. Grundl. Math. 6 (1960) 66-92.
3. J.R. Büchi, On a decision method in restricted second order arithmetic, in: Logic, Method. and Phil. of Sc., Proc. 1960 Internat. Congress (Stanford Univ. Press, Stanford, 1962).
4. J.R. Büchi, Transfinite automata recursions and weak second-order theory of ordinals, Notices Amer. Math. Soc. 12 (1965) 371-457.
5. K.J. Compton and C.W. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Ann. Pure Appl. Logic 48 (1990) 1-79.
6. J. Ferrante and C. Rackoff, A decision procedure for the first order theory of real addition with order, SIAM J. Comput. 4 (1975) 69-76.
7. S. Feferman and R.L. Vaught, The first order properties of products of algebraic systems, Fund. Math. XLVII (1959) 57-103.
8. M. Fisher and M. Rabin, Superexponential complexity of Presburger arithmetic, SIAM Proc. 7 (1974) 27-41.
9. T. Jech, Set Theory (Academic Press, New York, 1978).
10. A. Levy, Basic Set Theory (Springer, Berlin, 1979).
11. F. Maurin, The theory of integer multiplication with order restricted to primes is decidable, J. Symbolic Logic, to appear.
12. A.R. Meyer, Weak monadic second order theory of successor is not elementary-recursive, in: Boston Univ. Logic Colloquium Proc. (Springer, Berlin, 1975) 132-154.
13. A.L. Semenov, Decidability of monadic theories, Math. Foundations of Computer Science, Lecture Notes in Computer Science 176 (1984) 162-175.