Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-22T04:49:05.708Z Has data issue: false hasContentIssue false
  • English
  • Français

Set mappings of unrestricted order

Published online by Cambridge University Press:  17 April 2009

Greg G. Gibbon
Greg G. Gibbon
Affiliation:
Department of Mathematics, University of Queensland, St Lucia, Queensland 4067, Australia.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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

[1] Erdös, P. and Fodor, G., “Some remarks on set theory – V”, Acta Sci. Math. (Szeged) 17 (1957), 250–260.Google Scholar
[2] Erdös, P., Hajnal, A. and Rado, R., “Partition relations for cardinal numbers”, Acta Math. Acad. Sci. Hungar 16 (1965), 93–196.CrossRefGoogle Scholar
[3] Hajnal, A., “Proof of a conjecture of S. Ruziewicz”, Fund. Math. 50 (1961/1962), 123–128.CrossRefGoogle Scholar
[4] Hajnal, A. and Mate, A., “Set mappings, partitions, and chromatic numbers”, Logic Colloquium, 1973, 347–379 (North Holland, Amsterdam, 1975).Google Scholar
[5] Williams, Neil H., Combinatorial set theory (Studies in Logic and the Foundations of Mathematics, 91. North Holland, Amsterdam, New York, Oxford, 1977).CrossRefGoogle Scholar