Achilles and the tortoise climbing up the arithmetical hierarchy

Journal of Computer and System Sciences

Volumn 57, Issue 3, 1998, Pages 389-398

  Asarin, Eugene ^a   Maler, Oded ^b  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING; SET THEORY;

ARITHMETICAL HIERARCHY; DECIDING MEMBERSHIP; REACHABILITY PROBLEM;

INTEGER PROGRAMMING;

EID: 0032296245     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1601     Document Type: Article

References (7)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine, The algorithmic analysis of hybrid systems, Theoret. Comput. Sci. 138 (1995), 3-34.
2. P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry (Eds.), "Hybrid Systems II," Lecture Notes in Comput. Sci., Vol. 999, Springer-Verlag, New York/Berlin, 1995.
3. E. Asarin, O. Maler, and A. Pnueli, Reachability analysis of dynamical systems having piecewise-constant derivatives, Theoret. Comput. Sci. 138 (1995), 35-66.
4. O. Bournez, Some bounds on the computational power of piecewise constant derivative systems, in "Proc. ICALP'97" (P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds.), Lecture Notes in Comput. Sci., Vol. 1256, pp. 143-153, Springer-Verlag, New York/ Berlin, 1997.
5. O. Bournez, Achilles and the tortoise climbing up the hyper-arithmetical hiearchy, Theoret. Comput. Sci., to appear.
6. H. Rogers, "Theory of Recursive Functions and Effective Computability," McGraw-Hill, New York, 1967.
7. G. E. Sacks, "Higher Recursion Theory," Springer-Verlag, New York/ Berlin, 1990.