TY - JOUR
T1 - Fraïssé-Hintikka theorem in institutions
AU - Gaina, Daniel
AU - Kowalski, Tomasz
N1 - Publisher Copyright:
© The Author(s) 2020. Published by Oxford University Press. All rights reserved.
PY - 2020/10/1
Y1 - 2020/10/1
N2 - We generalize the characterization of elementary equivalence by Ehrenfeucht-Fraïssé 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.
AB - We generalize the characterization of elementary equivalence by Ehrenfeucht-Fraïssé 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.
UR - http://www.scopus.com/inward/record.url?scp=85097005829&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85097005829&partnerID=8YFLogxK
U2 - 10.1093/logcom/exaa042
DO - 10.1093/logcom/exaa042
M3 - Article
AN - SCOPUS:85097005829
VL - 30
SP - 1377
EP - 1399
JO - Journal of Logic and Computation
JF - Journal of Logic and Computation
SN - 0955-792X
IS - 7
ER -