Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2025-01-04T11:35:05.741Z Has data issue: false hasContentIssue false
  • English
  • Français

A proofless proof of the Barwise compactness theorem1

Published online by Cambridge University Press:  12 March 2014

Mark Howard
Mark Howard*
Affiliation:
Department of Mathematics, Purdue University, West Lafayette, Indiana 47907
*
Odyssey Research Associates, 30/A Harris B. Oates Drive, Ithaca, New York 14850-1313.
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove a theorem (1.7) about partial orders which can be viewed as a version of the Barwise compactness theorem which does not mention logic. The Barwise compactness theorem is easily equivalent to 1.7 + “Every Henkin set has a model”. We then make the observation that 1.7 gives us the definability of forcing for quantifier-free sentences in the forcing language and use this to give a direct proof of the truth and definability lemmas of forcing.

Type
Survey/expository papers
Information
The Journal of Symbolic Logic , Volume 53 , Issue 2 , June 1988 , pp. 597 - 602
Copyright
Copyright © Association for Symbolic Logic 1988

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

Footnotes

1

§§1 and 2 are a revision of the last chapter of Howard [1985].

References

REFERENCES

Barwise, J. [1975], Admissible sets and structures, Springer-Verlag, Berlin.CrossRefGoogle Scholar
Howard, M. [1985], Vaught's conjecture and the closed unbounded filter, Ph.D. thesis, University of California, Berkeley, California.Google Scholar
Keisler, H. J. [1971], Model theory for infinitary logic, North-Holland, Amsterdam.Google Scholar
Shoenfield, J. [1971], Unramified forcing, Axiomatic set theory, Proceedings of Symposia in Pure Mathematics, vol. 13, part 1, American Mathematical Society, Providence, Rhode Island, pp. 357–382.CrossRefGoogle Scholar