Article contents
Set mappings of unrestricted order
Published online by Cambridge University Press: 17 April 2009
Abstract
A set mapping on a set S is a function f mapping S into the powerset of S such that x ∉ f(x) for each x in S. The set map f has order θ if θ is the least cardinal such that |f(x)| < θ for each x in S. A subset H of S is free for f if x ∉ f(y) for all x, y in H. In this paper we use classical results about set mappings of large order to investigate conditions which ensure a large free set for set mappings of unrestricted order.
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 28 , Issue 2 , October 1983 , pp. 199 - 206
- Copyright
- Copyright © Australian Mathematical Society 1983
References
- 3
- Cited by