Fraïssé-Hintikka theorem in institutions

Daniel Gaina, Tomasz Kowalski

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)1377-1399
Number of pages23
JournalJournal of Logic and Computation
Volume30
Issue number7
DOIs
Publication statusPublished - Oct 1 2020

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Fraïssé-Hintikka theorem in institutions'. Together they form a unique fingerprint.

Cite this