Article contents
Almost combinatorial Skolem functions
Published online by Cambridge University Press: 12 March 2014
Extract
Let be a version of class set theory admitting urelemente, and with AC (= axiom of choice) replaced by AC0 (= axiom of choice for sets of finite sets), ω = nonnegative integers, and Δ = Dedekind cardinals. Let be an arbitrarily quantified positive first order sentence in functors for + and ·. Let ƒ0, … , ƒ κ - 1 be function variables and the universal sentence obtained from by replacing existential quantifiers by the ƒ1 as Skolem functions.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1970
Footnotes
The author is deeply indebted to Professors J. Myhill (A. Nerode), the inventors of combinatorial (almost combinatorial) functions for their long standing encouragement. He would also like to thank Professor H. Yoshizawa and the staff of Kyoto University for all their help. This paper was prepared while the author was supported by a New Jersey Research Council Faculty Fellowship.
References
- 3
- Cited by