Article contents
On definability of ordinals in logic with infinitely long expressions1
Published online by Cambridge University Press: 12 March 2014
Extract
Let Ω be an infinite cardinal larger than ω. By Lω we mean a language with infinitely long expressions having no individual constants, and such that the only predicates are < and =, and the length of ν or ∃ in a formula in Lω is smaller than Ω (cf. §2).
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1996
Footnotes
This work was done at Hughes Aircraft Company, Fullerton, California, and was sponsored by the Air Force Systems Command, Research and Technology Division, Rome Air Development Center, Griffiss Air Force Base, New York, 13442, under contract AF30(602)-3339. The author wishes to express her heart-felt thanks to Professor G. Takeuti for his valuable advice during the preparation of this paper. She is also indebted to Mr. G. E. Cash, Drs. F. B. Cannonito and V. H. Dyson for reading this paper in manuscript and correcting her English, and to the referee for his kind suggestions.
References
- 9
- Cited by