Hostname: page-component-cb9f654ff-lqqdg Total loading time: 0 Render date: 2025-08-19T12:44:01.364Z Has data issue: false hasContentIssue false
  • English
  • Français

Notions of relative ubiquity for invariant sets of relational structures

Published online by Cambridge University Press:  12 March 2014

Paul Bankston  and
Wim Ruitenburg
Paul Bankston
Affiliation:
Department of Mathematics, Marquette University, Milwaukee, Wisconsin 53233
Wim Ruitenburg
Affiliation:
Department of Mathematics, Marquette University, Milwaukee, Wisconsin 53233
Get access Rights & Permissions [Opens in a new window]

Abstract

Given a finite lexicon L of relational symbols and equality, one may view the collection of all L-structures on the set of natural numbers ω as a space in several different ways. We consider it as: (i) the space of outcomes of certain infinite two-person games; (ii) a compact metric space; and (iii) a probability measure space. For each of these viewpoints, we can give a notion of relative ubiquity, or largeness, for invariant sets of structures on ω. For example, in every sense of relative ubiquity considered here, the set of dense linear orderings on ω is ubiquitous in the set of linear orderings on ω.

Keywords

Spaces of relational structuresubiquitygamesBaire categoryprobabilitycomplete theories.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 55 , Issue 3 , September 1990 , pp. 948 - 986
Copyright
Copyright © Association for Symbolic Logic 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[1] Barwise, J. and Robinson, A., Completing theories by forcing, Annals of Mathematical Logic, vol. 2 (1970), pp. 119–142.CrossRefGoogle Scholar
[2] Berge, C., Principles of combinatorics, Academic Press, New York, 1971.Google Scholar
[3] Cameron, P. J., Aspects of the random graph, Graph theory and combinatorics (Proceedings of the Cambridge combinatorics conference in honor of Paul Erdös; Bollobás, B., editor), Academic Press, New York, 1984, pp. 65–79.Google Scholar
[4] Cameron, P. J., Seminar talk, Simon Fraser University, Burnaby, British Columbia, 11 1984.Google Scholar
[5] Davis, Morton, Infinite games of perfect information, Advances in game theory, Princeton University Press, Princeton, New Jersey, 1964, pp. 85–101.Google Scholar
[6] Fagin, R., Probabilities on finite models, this Journal, vol. 41 (1976), pp. 50–58.Google Scholar
[7] Gaifman, H., Concerning measures on first order calculi, Israel Journal of Mathematics, vol. 2 (1964), pp. 1–18.CrossRefGoogle Scholar
[8] Halmos, P., Measure theory, Van Nostrand, New York, 1950.CrossRefGoogle Scholar
[9] Hodges, W., Building models by games, Cambridge University Press, Cambridge, 1985.Google Scholar
[10] Hodkinson, I. M. and Macpherson, H. D., Relational structures determined by their finite induced substructures, this Journal, vol. 53 (1988), pp. 222–230.Google Scholar
[11] Keisler, H. J., Fundamentals of model theory, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 47–103.Google Scholar
[12] Lynch, J. F., Almost sure theories, Annals of Mathematical Logic, vol. 18 (1980), pp. 91–135.CrossRefGoogle Scholar
[13] Macintyre, A., Model completeness, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 139–180.Google Scholar
[14] Martin, D. A., Borel determinacy, Annals of Mathematics, ser. 2, vol. 102 (1975), pp. 363–371.CrossRefGoogle Scholar
[15] Macpherson, H. D., Graphs determined by their finite induced subgraphs, Journal of Combinatorial Theory, Series B, vol. 41 (1986), pp. 230–234.CrossRefGoogle Scholar
[16] Miller, A. W., On the Borel classification of the isomorphism type of a countable model, Notre Dame Journal of Formal Logic, vol. 24 (1983), pp. 22–34.CrossRefGoogle Scholar
[17] Nelson, E. (private communication).Google Scholar
[18] Oxtoby, J. C., The Banach-Mazur game and Banach category theorem, Contributions to the theory of games. Vol. 3, Princeton University Press, Princeton, New Jersey, 1957, pp. 158–163.Google Scholar
[19] Oxtoby, J. C., Measure and category, Springer-Verlag, Berlin, 1971.CrossRefGoogle Scholar
[20] Simms, J. (private communication).Google Scholar
[21] Slattery, M. (private communication).Google Scholar
[22] Telgarsky, R., Topological games: on the 50th anniversary of the Banach-Mazur game, Rocky Mountain Journal of Mathematics, vol. 17 (1987), pp. 227–276.Google Scholar
[23] Vaught, R., Invariant sets in topology and logic, Fundamenta Mathematicae, vol. 82 (1974), pp. 269–294.CrossRefGoogle Scholar
[24] Willard, S., General topology, Addison-Wesley, Reading, Massachusetts, 1970.Google Scholar
[25] Galvin, F. and Telgársky, R., Stationary strategies in topological games, Topology and Its Applications, vol. 22 (1986), pp. 51–69.CrossRefGoogle Scholar
[26] Keisler, H. J., Finite approximations of infinitely long formulas, The theory of models (Addison, J.et al, editors), North-Holland, Amsterdam, 1965, pp. 158–169.Google Scholar
[27] Fraïssé, R., Sur certaines relations qui généralisent l'ordre des nombres rationnels, Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences (Paris), vol. 237 (1953), pp. 540–542.Google Scholar
[28] Cameron, P. J., Cyclic automorphisms of a countable graph and random sum-free sets, Graphs and Combinatorics, vol. 1 (1985), pp. 129–135.CrossRefGoogle Scholar