A representation theorem for languages with generalized quantifiers through back-and-forth methods (Q752702)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A representation theorem for languages with generalized quantifiers through back-and-forth methods |
scientific article; zbMATH DE number 4179360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A representation theorem for languages with generalized quantifiers through back-and-forth methods |
scientific article; zbMATH DE number 4179360 |
Statements
A representation theorem for languages with generalized quantifiers through back-and-forth methods (English)
0 references
1988
0 references
The logic L(Q) generalising the ordinary logic \(L_{\omega \omega}\) by a system Q of Mostowski quantifiers is considered. For the language L(Q) some version of Fraissé-Ehrenfeucht-Taimanov game on structures is given. It is proved that formulas of L(Q) have representations by functors between categories of structures and partial isomorphisms.
0 references
representation of formulas
0 references
Mostowski quantifiers
0 references
Fraissé-Ehrenfeucht- Taimanov game
0 references
functors between categories of structures
0 references
0.7362649440765381
0 references
0.7325040698051453
0 references
0.7304257154464722
0 references
