Hostname: page-component-7c8c6479df-ph5wq Total loading time: 0 Render date: 2024-03-29T00:06:58.636Z Has data issue: false hasContentIssue false

Martin's axiom in the model theory of LA

Published online by Cambridge University Press:  12 March 2014

W. Richard Stark*
Affiliation:
University of Texas at Austin, Austin, TX 78712
*
University of South Florida, Tampa, FL 33620

Extract

Working in ZFC + Martin's Axiom we develop a generalization of the Barwise Compactness Theorem which holds in languages of cardinality less than . Next, using this compactness theorem, an omitting types theorem for fewer than types is proved. Finally, in ZFC, we prove that this compactness result implies Martin's Axiom (the Equivalence Theorem). Our compactness theorem applies to a new class of theories—ccΣ-theories—which generalize the countable Σ-theories of Barwise's theorem. The Omitting Types Theorem and the Equivalence Theorem serve as examples illustrating the use of ccΣ-theories.

Assume = (A, ε) or = (A, ε R1,…,Rm) where is admissible. L() is the first-order language with constants for elements of A and relation symbols for relations in . LA is AL∞ω where the L of L∞ω is any language in A. A theory T in LA is consistent if there is no derivation in A of a contradiction from T. is LA with new constants ca for each a and A. The basic terms of consist of the constants of and the terms f(ca1,…,cam) built directly from constants using functions f of . The symbol t is used for basic terms. A theory T in LA is Σ if it is defined by a formula of L(). The formula φ is a logical equivalent of ¬φ defined by: (1) φ = ¬φ if φ is atomic; (2) (¬φ) = φ (3) (⋁φ∈Φ φ) = ⋀φ∈Φ φ; (4) (⋀φ∈Φ φ) ⋁φ∈Φ φ; (5) (∃χφ(x))χφ(x); ∀χφ(x)) = ∃χφ(x).

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1980

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]Barwise, K. Jon, Admissible sets and structures, Springer, New York, 1975.CrossRefGoogle Scholar
[2]Blass, Andreas, Theories without countable models, this Journal,vol. 37 (1972), pp. 562568.Google Scholar
[3]Keisler, H. Jerome, Model theory for infinitary logic, North-Holland, Amsterdam, 1971.Google Scholar
[4]Martin, D. A. and Solovay, R., Internal Cohen Extensions, Annals of Mathematical Logic, vol. 2 (1970), pp. 143178.CrossRefGoogle Scholar
[5]Stark, Richard, A forcing approach to strict-Π11 reflection and strict-Π11 = Σ10, with applications in infinitary logic, PH.D. thesis, University of Wisconsin, Madison, 1975.Google Scholar