Preface
Choffrut, Christian ; Colson, Loïc
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008), p. 1-4 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_2008__42_1_1_0,
     author = {Choffrut, Christian and Colson, Lo\"\i c},
     title = {Preface},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {42},
     year = {2008},
     pages = {1-4},
     doi = {10.1051/ita:2007056},
     mrnumber = {2382540},
     zbl = {1149.01307},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_2008__42_1_1_0}
}

Choffrut, Christian; Colson, Loïc. Preface. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) pp. 1-4. doi : 10.1051/ita:2007056. http://gdmltest.u-ga.fr/item/ITA_2008__42_1_1_0/

[1] Serge Grigorieff Random reals “à la Chaitin” with no prefix-freeness (with V. Becher), submitted.

[2] Serge Grigorieff From index sets to randomness in ∅ n (Random reals and possibly infinite computations - Part II) (with V. Becher), submitted. | Zbl pre05532613

[3] Serge Grigorieff Random reals and halting probabilities (with V. Becher, S. Figueira and J.S. Miller). | Zbl 1152.03038

[4] Serge Grigorieff Random reals and possibly infinite computations - Part I: randomness in ∅’ (with V. Becher). J. Symbolic Logic 70 (2005) 891-913. | MR 2155271 | Zbl 1089.03037

[5] Serge Grigorieff 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. | MR 1858865 | Zbl 1063.68592

[6] Serge Grigorieff Kolmogorov complexities Kmin, Kmax on computable partially ordered sets (with M. Ferbus). Theor. Comput. Sci. 352 (2006) 159-180. | MR 2207514 | Zbl 1087.68044

[7] Serge Grigorieff Kolmogorov complexity and set theoretical representations of integers (with M. Ferbus). Math. Logic Quart. 52 (2006) 381-409. | MR 2252970 | Zbl 1107.03043

[8] Serge Grigorieff Kolmogorov complexity and non determinism (with J.-Y. Marion). Theor. Comput. Sci. 271 (2002) 151-180. | MR 1872288 | Zbl 0982.68076

[9] Serge Grigorieff Logics for finite words on infinite alphabets (with C. Choffrut), submitted.

[10] Serge Grigorieff Decision problems among the main subfamilies of rational relations (with C. Choffrut and O. Carton). RAIRO-Theor. Inf. Appl. 40 (2006) 255-275. | Numdam | MR 2252638 | Zbl 1112.03008

[11] Serge Grigorieff Separability of rational relations in A * ×N m by recognizable relations is decidable (with C. Choffrut). Inform. Process. Lett. 99 (2006) 27-32. | MR 2223575

[12] Serge Grigorieff Modelization of deterministic rational relations. Theor. Comput. Sci. 281 (2002) 423-453. | MR 1909583 | Zbl 0997.68072

[13] Serge Grigorieff 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. | MR 2028868

[14] Serge Grigorieff Uniformization of rational relations (with C. Choffrut), in Jewels are forever, book in honor of Arto Salomaa, Springer (1999) 59-71. | MR 1719021 | Zbl 0944.68107

[15] Serge Grigorieff Every recursive linear ordering has an isomorphic copy in DTIME-SPACE 55 (1990) 260-276. | MR 1043556 | Zbl 0708.03015

[16] Serge Grigorieff Synchronization of a bounded degree graph of cellular automata with non uniform delays in time Dlog m D. Theor. Comput. Sci. 356 (2006) 170-185. | MR 2217835 | Zbl pre05024254

[17] Serge Grigorieff Register cellular automata in the hyperbolic plane (with M. Margenstern). Fund. Inform. 61 (2004) 19-27. | MR 2076978 | Zbl 1083.68076

[18] Serge Grigorieff Syntactical truth predicates for second order arithmetic (with L. Colson). J. Symbolic Logic 66 (2001) 225-256. | MR 1825182 | Zbl 0978.03044

[19] Serge Grigorieff 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. | MR 1781524 | Zbl 0956.03006

[20] Serge Grigorieff Décidabilité et complexité des théories logiques. Collection Didactique INRIA 8 (1991) 7-97. | MR 1146961

[21] Serge Grigorieff Contribution à l'étude d'une conjecture de théorie des nombres par le codage ZBV (with Denis Richard). Enseign. Math. 35 (1989) 125-189. | MR 1010763 | Zbl 0685.03039

[22] Serge Grigorieff Recursion and topology on 2 ≤ω for possibly infinite computations (with V. Becher). Theor. Comput. Sci. 322 (2004) 85-136. | MR 2077723 | Zbl 1061.03075

[23] Serge Grigorieff Intermediate submodels and generic extensions in set theory. Ann. Math. 101 (1975) 447-490. | MR 373889 | Zbl 0308.02060

[24] Serge Grigorieff Modéles intermédiaires et extensions génériques. C. R. Acad. Sci. 276 (1973) 1635-1638. | Zbl 0258.02059

[25] Serge Grigorieff 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. | MR 379187 | Zbl 0316.02062

[26] Serge Grigorieff Combinatorics on ideals and forcing. Ann Math. Logic 3 (1971) 363-394. | MR 297560 | Zbl 0328.02041

[27] Serge Grigorieff Problème de la minimalité des réels définis par forcing à partir d'un ultrafiltre. C. R. Acad. Sci. 270 (1970) 169-172. | MR 265150 | Zbl 0188.02003

[28] Serge Grigorieff Détermination des jeux boréliens et problèmes logiques associés. Sém. Bourbaki 478 (1976) 1-14. | Numdam | Zbl 0359.02070

[29] Serge Grigorieff La non-contradiction relative de l'axiome de Martin. Publ. Math. Univ. Paris VII 5 (1979) 61-74. Séminaire GMS (Grigorieff, McAloon, Stern). | MR 658332 | Zbl 0533.03030

[30] Serge Grigorieff Le réel 0 # . Publ. Math. Univ. Paris VII 5 (1979) 149-162. Séminaire GMS (Grigorieff, McAloon, Stern). | MR 658337 | Zbl 0522.03036

[31] Serge Grigorieff 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). | MR 658338 | Zbl 0509.03028