Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-28T16:05:27.447Z Has data issue: false hasContentIssue false
  • English
  • Français

Algebraic independence

Published online by Cambridge University Press:  12 March 2014

Julia F. Knight
Julia F. Knight*
Affiliation:
University of Notre Dame, Notre Dame, Indiana 46556
Get access Rights & Permissions [Opens in a new window]

Extract

This paper is concerned with algebraic independence in structures that are relatively simple for their size. It is shown that for κ a limit cardinal, if a structure of power at least κ is ∞ω-equivalent to a structure of power less than κ, then must contain an infinite set of algebraically independent elements. The same method of proof yields the fact that if σ is an Lω1ω-sentence (not necessarily complete) and σ has a model of power ℵω then some model of σ contains an infinite algebraically independent set.

All structures are assumed to be of countable similarity type. Letters , etc. will be used to denote either a structure or the universe of the structure. If X ⊆ , the algebraic closure of X (in ), denoted by Cl(X), is the union of all finite sets that are weakly definable (in ) by Lωω-formulas with parameters from X. A set S is algebraically independent if for each a in S, a ∉ Cl(S – {a}). An algebraically independent set is sometimes called a “free” set (in [3] and [4], for example).

It is known (see [5]) that any structure of power ℵn must have a set of n algebraically independent elements, and there are structures of power ℵn with no independent set of size n + 1. In power ℵω every structure will have arbitrarily large finite algebraically independent sets. However, it is consistent with ZFC that some models of power ℵω do not have any infinite algebraically independent set. Devlin [4] showed that if V = L, then for any cardinal κ, if every structure of power κ has an infinite algebraically independent set, then κ has a certain large cardinal property that ℵω can never possess.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 46 , Issue 2 , June 1981 , pp. 377 - 384
Copyright
Copyright © Association for Symbolic Logic 1981

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.)

References

REFERENCES

[1]Baumgartner, J., The Hanf number for complete Lω1ω-sentences (without GCH), this Journal, vol. 39 (1974), pp. 575–578.Google Scholar
[2]Devlin, K., Aspects of constructibility, Lecture Notes in Mathematics, no. 354, Springer-Verlag, Berlin and New York, 1973.Google Scholar
[3]Devlin, K., Weak versions of large cardinal axioms, Annals of Mathematical Logic, vol. 5 (1973), pp. 291–325.CrossRefGoogle Scholar
[4]Devlin, L. K., More on the free subset problem, Annals of Mathematical Logic, vol. 5 (1973), pp. 327–336.CrossRefGoogle Scholar
[5]Knight, J., The Hanf number for omitting types over particular theories, this Journal, vol. 41 (1976), pp. 583–588.Google Scholar
[6]Knight, J., A complete -sentence characterizing ℵ1, this Journal, vol. 42 (1977), pp. 59–62.Google Scholar
[7]Malitz, J., The Hanf number for complete -sentences, The syntax and semantics of infinitary languages, Lecture Notes in Mathematics, no. 72, Springer-Verlag, Berlin and New York, 1968, pp. 166–181.CrossRefGoogle Scholar
[8]Morley, M., Categoricity in power, Transactions of the American Mathematical Society, vol. 114 (1965), pp. 514–518.CrossRefGoogle Scholar
[9]Ressayre, J. P., Models with compactness properties relative to an admissible language, Annals of Mathematical Logic, vol. 11 (1977), pp. 31–55.CrossRefGoogle Scholar