Computer science and the fine structure of Borel sets
- 1 April 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 257 (1-2) , 85-105
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Locally finite languagesTheoretical Computer Science, 2001
- Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rankThe Journal of Symbolic Logic, 2001
- The monadic second-order logic of graphs X: Linear orderingsTheoretical Computer Science, 1996
- StretchingsThe Journal of Symbolic Logic, 1996
- The monadic second-order logic of graphs IX: Machines and their behavioursTheoretical Computer Science, 1995
- Formal Languages Defined by the Underlying Structure of their WordsThe Journal of Symbolic Logic, 1988
- Les propriétés de réduction et de norme pour les classes de BoréliensFundamenta Mathematicae, 1988
- A purely inductive proof of Borel determinacy1985
- Functors and ordinal notations. I: A functorial construction of the veblen hierarchyThe Journal of Symbolic Logic, 1984
- Borel DeterminacyAnnals of Mathematics, 1975