Name
Abstract | ||
|---|---|---|
We generalize the characterization of elementary equivalence by Ehrenfeucht-Fraisse games to arbitrary institutions whose sentences are finitary. These include many-sorted first-order logic, higher-order logic with types, as well as a number of other logics arising in connection to specification languages. The gain for the classical case is that the characterization is proved directly for all signatures, including infinite ones. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1093/logcom/exaa042 | JOURNAL OF LOGIC AND COMPUTATION |
DocType | Volume | Issue |
Journal | 30 | 7 |
ISSN | Citations | PageRank |
0955-792X | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Găină | 1 | 42 | 5.30 |
| Tomasz Kowalski | 2 | 124 | 24.06 |