On elementary equivalence for fragments of language L__ 1,

MaRDI QIDQ1901896zbMATH OpenFDO

Authors S. S. Magazov

Publication date 3 January 1996

Published in Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

Ehrenfeucht gameselementary equivalencefinitely categorical languagesfinitely generated model

Mathematics Subject Classification ID

Other infinitary logic (03C75)

Review text

We study fragments of the language \(L_{\omega_1, \omega}\), which are described by means of one formula for any finitely generated model up to isomorphism. These fragments are called finitely categorical languages. The lack of the compactness theorem for certain finitely categorical languages, both in J. Barwise's form and in classical form, calls for a new technique for answering model-theoretic questions. Here we offer a technique permitting to describe equivalent models for finitely categorical languages. For logics of first order, Ehrenfeucht games give a suitable criterion for elementary equivalence. Naturally, there is a wish to generalize this method to the languages under consideration. We show that for finitely categorical languages the Ehrenfeucht criterion is not a necessary condition for equivalence. We find necessary and sufficient conditions for the validity of the Ehrenfeucht criterion.

Recommendations

• Games in finite model theory
• An Ehrenfeucht-Fraïssé game for \(\mathcal L_{\omega_1\omega}\)
• Theories categorical in power \(n+2\)
• Model theory for \(L_{\infty \omega _ 1}\)
• scientific article; zbMATH DE number 3906482

Cited in

(3)

• Games in finite model theory
• A Language for Category Theory in which Natural Equivalence Implies Elementary Equivalence of Models
• Model theory for \(L_{\infty \omega _ 1}\)

This page was built for publication: On elementary equivalence for fragments of language \(L_{\omega_ 1,\omega}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901896)