Ehrenfeucht games and ordinal addition

Annals of Pure and Applied Logic

Volumn 89, Issue 1, 1997, Pages 53-73

  Maurin, Françoise ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031574507     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(97)00005-5     Document Type: Article

References (14)

1. [1] J.R. Büchi, Weak second-order arithmetic and finite automata, Zeitschrift Math. Log. Grundl. Math. 6 (1960) 66-92.
2. [2] J.R. Büchi, Transfinite automata recursions and weak second-order theory of ordinals, Notices Amer. Math. Soc. 12 (1965) 371-457.
3. [3] 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.
4. [4] A. Ehrenfeucht, Application of games to some problems of Mathematical Logic, Bull. Académie Polonaise Sci, III.V.I (1957) 35-37.
5. [5] A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961) 129-141.
6. [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. [7] J. Ferrante and C. Rackoff, The computational complexity of logical theories, Lectures Notes in Math., vol. 718, Springer, Berlin, 1979.
8. [8] R. Fraïssé, Sur l'extension aux relations de quelques propriétés des ordres, C.R. Acad. Sci. Paris 237 (1953) 508-510.
9. [9] R. Fraïssé, Sur les rapports entre la théorie des relations et la sémantique au sens de A. Tarski, Colloque de Logique Mathématique, Paris, 1959.
10. [10] S. Feferman and R.L. Vaught, The first order properties of products of algebraic systems, Fund. Math. XLVII (1959) 57-103.
11. [11] F. Maurin, Complexité de l'addition ordinale, Thesis, University of Caen, 1994.
12. [12] F. Maurin, The theory of positive integers with multiplication and restriction of < to the set of prime numbers is decidable, preprint, 1995.
13. [13] A.R. Meyer, Weak monadic second order theory of successor is not elementary-recursive, Boston Univ. Logic Colloquium Proc., Springer, Berlin, 1975, pp. 132-154.
14. [14] J. Robinson, Definability and decision problems in arithmetic, J. Symbolic Logic 14 (1949) 98-114.