Some applications of infinitely long formulas

Journal of Symbolic Logic 30 (3):339-349 (1965)
  Copy   BIBTEX

Abstract

Introduction. This paper is a sequel to our paper [3]. In that paper we introduced the notion of a finite approximation to an infinitely long formula, in a language L with infinitely long expressions of the type considered by Henkin in [2]. The results of the paper [3] show relationships between the models of an infinitely long sentence and the models of its finite approximations. In the present paper we shall apply the main result of [3] to prove a number of theorems about ordinary finitely long sentences; these theorems are of a type which one might call “preservation theorems”. The following two known results are typical preservation theorems: A sentence φ is preserved under substructures if and only if φ is equivalent to some universal sentence ; φ is preserved under homomorphic images if and only if φ is equivalent to some positive sentence. An expository account of preservation theorems may be found in Lyndon [9].We shall use freely all of the notation introduced in [3], and shall not attempt to make this paper selfcontained. However, the reader should have no difficulty following this paper after he has read [3]. In § 1 we cover some preliminary topics. In § 2 and § 3 we shall illustrate our method in familiar situations by proving anew the two preservation theorems mentioned above. We shall then obtain four new preservation theorems in §§ 4, 5, and 6, involving respectively direct powers and roots, strong homomorphisms and retracts, and direct factors. The result in § 6 was stated in the abstract [4], while the results in § 5 were stated in the abstract [5].

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Theory of models with generalized atomic formulas.H. Jerome Keisler - 1960 - Journal of Symbolic Logic 25 (1):1-26.
On the logic of informational independence and its applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.
Logical feedback.David Booth - 1991 - Studia Logica 50 (2):225 - 239.
A deontic logic of action.Krister Segerberg - 1982 - Studia Logica 41 (2-3):269 - 282.
Linguistic applications of first order intuitionistic linear logic.Richard Moot & Mario Piazza - 2001 - Journal of Logic, Language and Information 10 (2):211-232.
Labelled deductive systems.Dov M. Gabbay - 1996 - New York: Oxford University Press.
Some remarks on infinitely long formulas.L. Henkin - 1961 - Journal of Symbolic Logic 30 (1):167--183.

Analytics

Added to PP
2009-01-28

Downloads
36 (#385,000)

6 months
2 (#668,348)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Local definability theory.Gonzalo E. Reyes - 1970 - Annals of Mathematical Logic 1 (1):95-137.
Interpolation Theorem and Characterization Theorem.Nobuyoshi Motohashi - 1972 - Annals of the Japan Association for Philosophy of Science 4 (2):85-150.
Game sentences and ultrapowers.Renling Jin & H. Jerome Keisler - 1993 - Annals of Pure and Applied Logic 60 (3):261-274.
On Relations between Structures.Per Lindström - 1966 - Theoria 32 (3):172-185.
A note on definability in equational logic.George Weaver - 1994 - History and Philosophy of Logic 15 (2):189-199.

View all 9 citations / Add more citations

References found in this work

Some uses of mathematics.G. Kreisel - 1956 - British Journal for the Philosophy of Science 7 (26):161-173.

Add more references