Skip to main content
Conference ProceedingsOPEN ACCESS

On the Ehrenfeucht-Fraïssé game in theoretical computer science

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 668 LNCS 559-568
DOI: 10.1007/3-540-56610-4_89
49Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An introduction to (first-order) Ehrenfeucht-Fraïssé games is presented, and three applications in theoretical computer science are discussed. These are concerned with the expressive power of first-order logic over graphs, formal languages definable in first-order logic, and modal logic over labelled transition systems.

Cite

CITATION STYLE

APA

Thomas, W. (1993). On the Ehrenfeucht-Fraïssé game in theoretical computer science. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 668 LNCS, pp. 559–568). Springer Verlag. https://doi.org/10.1007/3-540-56610-4_89

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free