Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
Reals which compute little
Published online by Cambridge University Press: 31 March 2017
By
Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
- Type
- Chapter
- Information
- Logic Colloquium '02 , pp. 261 - 275Publisher: Cambridge University PressPrint publication year: 2006
References
[1] and , Lowness properties of r.e. sets, Manuscript, UW Madison, 1982.
[2] , ., and , Array nonrecursive sets and multiple permitting arguments Recursion Theory Week, Oberwolfach 1989 (, , and , editors), Lecture Notes in Mathematics, vol. 1432, Springer–Verlag, Heidelberg, 1990, pp. 141–174.l
[3] , , , and , Trivial reals Proceedings of the 7th and 8th Asian Logic Conferences, Singapore Univ. Press, Singapore, 2003, pp. 103–131.
[4] , , and , Combinatorial lowness properties Annals of Pure and Applied Logic, to appear.
[5] , Weak recursive degrees and a problem of Spector Recursion Theory and Complexity (Kazan, 1997), de Gruyter Series in Logic and its Applications, vol. 2, de Gruyter, Berlin, 1999, pp. 81–87.
[6] . and , Π0/1 classes and degrees of theories Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56.
[7] , , and , Lowness for the class of Schnorr random sets SIAM Journal on Computing, to appear.
[8] , A refinement of low n and high n for the r.e. degrees Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, vol. 32 (1986), no. 1, pp. 5–12.
[9] , Lowness properties and randomness Advances in Mathematics, vol. 197 (2005), pp. 274–305.
[10] , Recursively Enumerable Sets and Degrees, Perspectives inMathematical Logic, Omega Series, Springer–Verlag, Heidelberg, 1987.
[11] and , Algorithmic randomness and lowness The Journal of Symbolic Logic, vol. 66 (2001), pp. 1199–1205.
- 6
- Cited by