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
Ash's theorem for abstract structures
Published online by Cambridge University Press: 31 March 2017
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. 327 - 341Publisher: Cambridge University PressPrint publication year: 2006
References
[1] , Generalizations of enumeration reducibility using recursive infinitary propositional sentences Annals of Pure and Applied Logic, vol. 58 (1992), no. 3, pp. 173–184.
[2] , , , and , Generic copies of countable structures Annals of Pure and Applied Logic, vol. 42 (1989), no. 3, pp. 195–205.
[3] , Effective model theory vs. recursive model theory The Journal of Symbolic Logic, vol. 55 (1990), no. 3, pp. 1168–1191.
[4] S. B. Cooper, Partial degrees and the density problem. II. The enumeration degrees of the Σ2 sets are dense The Journal of Symbolic Logic, vol. 49 (1984), no. 2, pp. 503–513.
[5] , Enumeration reducibility, nondeterministic computations and relative computability of partial functions Recursion Theory Week (Oberwolfach, 1989) (,G. H.Müller, andG. E. Sacks, editors), Lecture Notes in Mathematics, vol. 1432, Springer, Berlin, 1990, pp. 57–110.Google Scholar
[6] , Jumps of quasi-minimal enumeration degrees The Journal of Symbolic Logic, vol. 50 (1985), no. 3, pp. 839–848.
[7] , Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Company, New York, 1967.
[8] , Higher Recursion Theory, Springer-Verlag, Berlin, 1990.
[9] and , Regular enumerations The Journal of Symbolic Logic, vol. 67 (2002), no. 4, pp. 1323–1343.
- 2
- Cited by