Fraïssé-Hintikka theorem in institutions

Daniel Gaina; Tomasz Kowalski

doi:10.1093/logcom/exaa042

Fraïssé-Hintikka theorem in institutions

Daniel Gaina, Tomasz Kowalski

Australia Branch

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	1377-1399
Number of pages	23
Journal	Journal of Logic and Computation
Volume	30
Issue number	7
DOIs	https://doi.org/10.1093/logcom/exaa042
Publication status	Published - Oct 1 2020

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Arts and Humanities (miscellaneous)
Hardware and Architecture
Logic

Access to Document

10.1093/logcom/exaa042

Cite this

@article{adf7884af57848d0ae4e93a59fac1f9e,

title = "Fra{\"i}ss{\'e}-Hintikka theorem in institutions",

abstract = "We generalize the characterization of elementary equivalence by Ehrenfeucht-Fra{\"i}ss{\'e} 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.",

author = "Daniel Gaina and Tomasz Kowalski",

year = "2020",

month = oct,

day = "1",

doi = "10.1093/logcom/exaa042",

language = "English",

volume = "30",

pages = "1377--1399",

journal = "Journal of Logic and Computation",

issn = "0955-792X",

publisher = "Oxford University Press",

number = "7",

}

TY - JOUR

T1 - Fraïssé-Hintikka theorem in institutions

AU - Gaina, Daniel

AU - Kowalski, Tomasz

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

SN - 0955-792X

VL - 30

SP - 1377

EP - 1399

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

IS - 7

ER -

Fraïssé-Hintikka theorem in institutions

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this