Skip to main content Accessibility help
Home

Infinitary formulas preserved under unions of models1

Extract

So-called “preservation theorems” relate the (possible) syntactic form of the axioms of a theory to certain closure conditions on its class of models. Such results are well known for the first-order predicate calculus, Lω, ω, and there are various expositions; e.g., Keisler [14], [15]. For the language , the first results were the theorems of Lopez-Escobar on sentences preserved under homomorphic images and of Malitz on formulas preserved under substructures. More recently, Feferman added a result on formulas preserved under (or persistent for) ∈-extensions. Some of these theorems will be considered in subsequent sections. A more thorough treatment may be found in Makkai [17]. The main new preservation result obtained here characterizes the sentences preserved under ω-unions. This notion and the statement of the theorem will be explained shortly.

It is a familiar experience in mathematical research that concepts which are equivalent in a special case diverge in general. In the case at hand, one must expect to consider different possible statements for , which generalize a known result for Lω, ω. Moreover, diverse proofs may yield the same result in the special case, not all of which can be extended to the general case. Again, since the compactness theorem fails for , one cannot expect to extend the arguments from Lω, ω which use this in an essential way.

Footnotes

Hide All
1

This paper forms part of the author's Ph.D. thesis, submitted to Stanford University in May, 1970. We would like to thank our thesis adviser, Professor Solomon Feferman, for his advice and direction and unfailing willingness to give of his time and effort throughout our work. We also thank Professor Georg Kreisel for his interest and many helpful suggestions.

References

Hide All
[1]Barwise, J., Infinitary logic and admissible sets, this Journal, vol. 34 (1969), pp. 226252.
[2]Barwise, J., Remarks on universal sentences of , Duke Mathematical Journal, vol. 36 (1969), pp. 631637.
[3]Barwise, J., Infinitary logic and admissible sets, Dissertation, Stanford University, 1967.
[4]Beth, E., Semantic entailment and formal derivability, Mededelingen van de Koninklijke Vlaamse Academic voor Wetenschappen, Letteren en Schone Kunsten van Belgie, vol. 18 (1955), pp. 309342.
[5]Chang, C. C., On unions of chains of models, Proceedings of the American Mathematical Society, vol. 10 (1959), pp. 120127.
[6]Feferman, S., Lectures on proof theory, Proceedings of the Summer School in Logic (Leeds, 1967), Lecture Notes in Mathematics, no. 70, Springer-Verlag, 1968, pp. 1107.
[7]Feferman, S., Persistent and invariant formulas for outer extensions, Compositio Mathematica, vol. 20 (1969), pp. 2952.
[8]Feferman, S. and Kreisel, G., Persistent and invariant formulas relative to theories of higher order, Bulletin of the American Mathematical Society, vol. 72 (1966), pp. 480485.
[9]Henkin, L., An extension of the Craig-Lyndon interpolation theorem, this Journal, vol. 28 (1963), pp. 201206.
[10]Hintikka, J., Form and content in quantification theory, Acta Philosophica Fennica, vol. 8 (1955), pp. 755.
[11]Kanger, S., Provability in logic, Almquist and Wiksell, Stockholm, 1957.
[12]Karp, C., Languages with expressions of infinite length, North-Holland, Amsterdam, 1964.
[13]Keisler, H. J., Model theory for , Unpublished Lecture Notes, University of Wisconsin, 1969.
[14]Keisler, H. J., Some applications of infinitely long formulas, this Journal, vol. 30 (1965), pp. 339349.
[15]Keisler, H. J., Unions of relational systems, Proceedings of the American Mathematical Society, vol. 15 (1964), pp. 540545.
[16]Lopez-Escobar, E. G. K., An interpolation theorem for denumerably long formulas, Fundamenta Mathematicae, vol. 57 (1965), pp. 254272.
[17]Makkai, M., On the model theory of denumerably long formulas with finite strings of quantifiers, this Journal, vol. 34 (1969), pp. 437459.
[18]Makkai, M., An application of a method of Smullyan's to logic on admissible sets, Bulletin de l'Académie Polonaise des Sciences, vol. 17 (1969), pp. 341346.
[19]Malitz, J., Problems in the model theory of infinitary languges, Doctoral Dissertation, University of California, Berkeley, 1965.
[20]Malitz, J., Universal classes in infinitary languages, Duke Mathematical Journal, vol. 36 (1969), pp. 621630.
[21]Nebres, B., A syntactic characterization of infinitary sentences preserved under unions of models, Notices of the American Mathematical Society, vol. 16 (1969), pp. 423424.
[22]Schütte, K., Ein System des verknüpfenden Schliessens, Archiv für mathematische Logik und Grundlagenforschung, vol. 2 (1956), pp. 5657.
[23]Scott, D., Logic with denumerably long formulas and finite strings of quantifiers, The theory of models, North-Holland, Amsterdam, 1965, pp. 329341.
[24]Smullyan, R., First-order logic, Springer-Verlag, New York, 1968.
[25]Weinstein, J., 1, ω) Properties of unions of models, The syntax and semantics of infinitary languages, Lecture Notes in Mathematics, No. 72, Springer-Verlag, 1968, pp. 265268.

Infinitary formulas preserved under unions of models1

Metrics

Full text viewsFull text views reflects the number of PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract viewsAbstract views reflect the number of visits to the article landing page.

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.