EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 42 / No 1 (January-March 2008) RAIRO-Theor. Inf. Appl., 42 1 (2008) 1-4 References
Free Access
Foreword
Issue
RAIRO-Theor. Inf. Appl.
Volume 42, Number 1, January-March 2008
A nonstandard spirit among computer scientists:a tribute to Serge Grigorieff at the occasion of his 60th birthday
Page(s) 1 - 4
DOI https://doi.org/10.1051/ita:2007056
Published online 18 January 2008
  1. Random reals “à la Chaitin” with no prefix-freeness (with V. Becher), submitted. [Google Scholar]
  2. From index sets to randomness in ∅n (Random reals and possibly infinite computations – Part II) (with V. Becher), submitted. [Google Scholar]
  3. Random reals and halting probabilities (with V. Becher, S. Figueira and J.S. Miller). [Google Scholar]
  4. Random reals and possibly infinite computations – Part I: randomness in ∅ (with V. Becher). J. Symbolic Logic 70 (2005) 891–913. [Google Scholar]
  5. Is randomness native to computer science? (with M. Ferbus), Curr. Trends Theor. Comput. Sci. 2 (2004) 141–179. Preliminary version in Bull. EATCS 74 (2001) 78–118. [Google Scholar]
  6. Kolmogorov complexities Kmin, Kmax on computable partially ordered sets (with M. Ferbus). Theor. Comput. Sci. 352 (2006) 159–180. [CrossRef] [Google Scholar]
  7. Kolmogorov complexity and set theoretical representations of integers (with M. Ferbus). Math. Logic Quart. 52 (2006) 381–409. [Google Scholar]
  8. Kolmogorov complexity and non determinism (with J.-Y. Marion). Theor. Comput. Sci. 271 (2002) 151–180. [Google Scholar]
  9. Logics for finite words on infinite alphabets (with C. Choffrut), submitted. [Google Scholar]
  10. Decision problems among the main subfamilies of rational relations (with C. Choffrut and O. Carton). RAIRO-Theor. Inf. Appl. 40 (2006) 255–275. [Google Scholar]
  11. Separability of rational relations in A* x Nm by recognizable relations is decidable (with C. Choffrut). Inform. Process. Lett. 99 (2006) 27–32. [Google Scholar]
  12. Modelization of deterministic rational relations. Theor. Comput. Sci. 281 (2002) 423–453. [Google Scholar]
  13. The theory of rational relations on transfinite strings (with C. Choffrut), in Words, Languages and Combinatorics III (Kyoto, March 2000), World Scientific (2004) 103–151. [Google Scholar]
  14. Uniformization of rational relations (with C. Choffrut), in Jewels are forever, book in honor of Arto Salomaa, Springer (1999) 59–71. [Google Scholar]
  15. Every recursive linear ordering has an isomorphic copy in DTIME-SPACE (n, log(n)). J. Symbolic Logic 55 (1990) 260–276. [CrossRef] [MathSciNet] [Google Scholar]
  16. Synchronization of a bounded degree graph of cellular automata with non uniform delays in time DlogmD. Theor. Comput. Sci. 356 (2006) 170–185. [Google Scholar]
  17. Register cellular automata in the hyperbolic plane (with M. Margenstern). Fund. Inform. 61 (2004) 19–27. [Google Scholar]
  18. Syntactical truth predicates for second order arithmetic (with L. Colson). J. Symbolic Logic 66 (2001) 225–256. [Google Scholar]
  19. La théorie élémentaire de la fonction de couplage de Cantor des entiers naturels est décidable (with P. Cégielski and D. Richard). C. R. Acad. Sci. Sér. 1 331 (2000) 107–110. [Google Scholar]
  20. Décidabilité et complexité des théories logiques. Collection Didactique INRIA 8 (1991) 7–97. [Google Scholar]
  21. Contribution à l'étude d'une conjecture de théorie des nombres par le codage ZBV (with Denis Richard). Enseign. Math. 35 (1989) 125–189. [Google Scholar]
  22. Recursion and topology on 2≤ω for possibly infinite computations (with V. Becher). Theor. Comput. Sci. 322 (2004) 85–136. [Google Scholar]
  23. Intermediate submodels and generic extensions in set theory. Ann. Math. 101 (1975) 447–490. [Google Scholar]
  24. Modéles intermédiaires et extensions génériques. C. R. Acad. Sci. 276 (1973) 1635–1638. [Google Scholar]
  25. Minimalité des réels définis par forcing sur des familles d'arbres de suites finies d'entiers. C. R. Acad. Sci. 281 (1975) 301–304. [Google Scholar]
  26. Combinatorics on ideals and forcing. Ann Math. Logic 3 (1971) 363–394. [Google Scholar]
  27. Problème de la minimalité des réels définis par forcing à partir d'un ultrafiltre. C. R. Acad. Sci. 270 (1970) 169–172. [Google Scholar]
  28. Détermination des jeux boréliens et problèmes logiques associés. Sém. Bourbaki 478 (1976) 1–14. [Google Scholar]
  29. La non-contradiction relative de l'axiome de Martin. Publ. Math. Univ. Paris VII 5 (1979) 61–74. Séminaire GMS (Grigorieff, McAloon, Stern). [Google Scholar]
  30. Le réel 0#>. Publ. Math. Univ. Paris VII 5 (1979) 149–162. Séminaire GMS (Grigorieff, McAloon, Stern). [Google Scholar]
  31. 0# et les injections élémentaires de L dans L. Publ. Math. Univ. Paris VII 5 (1979) 163–202. Séminaire GMS (Grigorieff, McAloon, Stern). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.