On Characterizing Elementary Logic
This is an expository paper. My aim is to explain in a way accessible to the non-specialist a number of results that amount to characterizations of elementary logic (EL), i.e. first order predicate logic with identity. The characterizations that I have in mind can be described as follows: First I define the very general concept abstract logic (AL). Then I define an inclusion relation ⊆ between ALs. Intuitively L⊆L′ means that everything that can be expressed in L can also be expressed in L′ although perhaps in a different way. For example, in EL it can be said of a binary relation that it is transitive. Thus if EL⊆L, this can also be expressed in L. (I assume, of course, that EL is an AL) L and L′ are equivalent, L≡L’ if L⊆L′ and L′⊆L. The next step consists in choosing a number of properties P 1,…,P n of ALs such that EL has P 1,…, P n . An example of an interesting property of this type is the following which may be called the Lowenheim property, since it means that the original Löwenheim theorem holds for L: If a sentence of L has a model, then it has a countable (finite or denumerable) model. Finally, a characterization of EL is a (true) statement of the form: If L is an AL, EL⊆L, and L has P 1,…, P n , then L≡EL. Since all reasonable ALs contain EL, this may also be expressed by saying that EL is the strongest AL having P 1,…, P n . Of course, one can also speak of characterizations of logics other than EL and there are, in fact, results of this type but they will not be discussed here.
Unable to display preview. Download preview PDF.
- E. W. Beth, Semantic Entailment and Formal Derivability, 1955. Reprinted in The Philosophy of Mathematics (ed. by J. Hintikka ), Oxford 1969, pp. 9–41.Google Scholar
- H. Friedman, Why First-Order Logic?, Mimeographed, 1970.Google Scholar
- G. Fuhrken, ‘Skolem-Type Normal Forms for First Order Languages with a Generalized Quantifier’, Fund. Math. 54 (1964), 291–302.Google Scholar
- S. C. Kleene, Introduction to Metamathematics, Amsterdam 1962.Google Scholar
- P. Lindström, ‘A Characterization of Elementary Logic’, in Modality, Morality and Other Problems of Sense and Nonsense, Essays dedicated to Soren Hallden, Lund, 1973, pp. 189–191.Google Scholar
- A. Mostowski, ‘On a Generalization of Quantifiers’, Fund. Math. 44 (1957), 12–6.Google Scholar
- S. Shelak, Generalized Quantifiers and Compact Logic, to appear.Google Scholar
- J. R. Shoenfield, Mathematical Logic, Addison-Wesley, 1967.Google Scholar
- B. A. Trakhtenbrot, ‘On Recursive Separability’, Dokl. Akad. Nauk SSSR 88 (1953), 953–956.Google Scholar
- 12]R. L. Vaught, ‘The Completeness of Logic with the Added Quantifier’ ‘There Are Uncountably Many’, Fund. Math. 54 (1964), 303–304.Google Scholar