scientific article; zbMATH DE number 3906482
This paper is concerned with the possibility of doing model theory for extensions of the ordinary large infinitary languages. One would like to approximate isomorphism by elementary equivalence which coincides with isomorphism on structures of small (uncountable) cardinality; to keep the known properties of the model theory of the \(L_{\infty \lambda}\); and (what is not studied in this paper) to have some good properties (like interpolation) lacking from \(L_{\infty \lambda}\). This paper studies very general game sentences (including Vaught-sentences) defined in terms of generalized syntactic trees in which infinite branches are allowed; the nodes are labelled by logical symbols \(\vee\), \(\wedge\), \(\exists x\), \(\forall x\) and (possibly negated) atomic formulas. Satisfaction is defined in an obvious way by a semantic game. (Such formulas were first studied by \textit{J. Hintikka} and \textit{V. Rantala} in Ann. Math. Logic 10, 95-115 (1976; Zbl 0339.02013).) The main results of the paper include (besides Löwenheim-Skolem and Łos Theorems) a characterization of elementary equivalence in terms of long Ehrenfeucht-Fraissé games (or tree-like partial isomorphisms in the terminology of the author) which means that elementary equivalence between small structures implies isomorphism. It is shown that weak compactness (in terms of \(L_{\kappa \kappa})\) \(+\) strong inaccessibility is equivalent with weak compactness in the language of the paper (with the parameter \(\kappa)\). The paper also includes a strengthening on a theorem of \textit{M. Benda} in J. Symb. Logic 34, 424-436 (1969; Zbl 0184.014) to game sentences. The paper is the author's doctoral dissertation and some of its results have been published earlier in Essays on mathematical and philosophical logic, Proc. 4th Scand. Logic Symp. 1st Soviet-Finnish Logic Conf., Jyväskylä 1976, 153-168 (1979; Zbl 0413.03023) and in the article reviewed above.
- Maximal infinite-valued constraint languages
- Model theoretic results for infinitely deep languages
- On \(\kappa\)-complete reduced products
- Almost free groups and long Ehrenfeucht-Fraïssé games
- Almost free groups and Ehrenfeucht-Fraïssé games for successors of singular cardinals
- On elementary equivalence for fragments of language \(L_{\omega_ 1,\omega}\)
- Generalized descriptive set theory and classification theory
- scientific article; zbMATH DE number 444448 (Why is no real title available?)
- Borel* sets in the generalized Baire space and infinitary languages
- Model theory for infinite quantifier languages
- scientific article; zbMATH DE number 1163933 (Why is no real title available?)
- Applications of model theory to the study of ‘soft’ universals in language
- Model theory for \(L_{\infty \omega _ 1}\)
- Logical operations and iterated infinitely deep languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3684110)