Article contents
Stepping up lemmas in definable partitions
Published online by Cambridge University Press: 12 March 2014
Abstract
Several stepping up lemmas are proved which are then used to investigate the connection between definable partition relations and admissible ordinals.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1984
References
REFERENCES
- 3
- Cited by