Fraïssé-Hintikka theorem in institutions

Daniel Gaina, Tomasz Kowalski

研究成果: Contribution to journalArticle査読

抄録

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.

本文言語英語
ページ(範囲)1377-1399
ページ数23
ジャーナルJournal of Logic and Computation
30
7
DOI
出版ステータス出版済み - 10 1 2020

All Science Journal Classification (ASJC) codes

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

フィンガープリント 「Fraïssé-Hintikka theorem in institutions」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル