Preface
From MaRDI portal
Publication:5900158
DOI10.1051/ita:2007056zbMath1149.01307OpenAlexW4251834192WikidataQ126686455 ScholiaQ126686455MaRDI QIDQ5900158
Christian Choffrut, Loïc Colson
Publication date: 21 July 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92860
Cites Work
- Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable
- Intermediate submodels and generic extensions in set theory
- Modelization of deterministic rational relations
- Contribution à l'étude d'une conjecture de théorie des nombres par le codage ZBV. (Contribution to the study of a conjecture of number theory by ZBV coding)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Random reals à la Chaitin with or without prefix-freeness
- Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\)
- Syntactical truth predicates for second order arithmetic
- Decision problems among the main subfamilies of rational relations
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- From index sets to randomness in ∅n: random reals and possibly infinite computations part II
- Combinatorics on ideals and forcing
- Random reals and possibly infinite computations Part I: Randomness in ∅′
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Preface
