Ehrenfeucht-Fraïssé games in finite set theory
type: Item
instance of: scholarly article
title: Ehrenfeucht-Fraïssé games in finite set theory
zbMATH Open document ID: 1185.03077
author: B. E. Eshmatov
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 03E70
Mathematics Subject Classification ID: 03B20
Mathematics Subject Classification ID: 03C13
zbMATH DE Number: 5694993
zbMATH Keywords: specification languages
zbMATH Keywords: arithmetic predicates
zbMATH Keywords: finite set theory
zbMATH Keywords: fragments of first-order logic
zbMATH Keywords: inexpressibility
zbMATH Keywords: Ehrenfeucht-Fraïssé games
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.03.011
OpenAlex ID: W2029806155
cites work: Modal languages and bounded fragments of predicate logic
cites work: Q4075450
cites work: Modal logic
cites work: Q4255575
cites work: Elementary Properties of the Finite Ranks
cites work: Q4227581
cites work: A hierarchy of formulas in set theory
cites work: Elements of finite model theory.
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: Arithmetic, first-order logic, and counting quantifiers
DOI: 10.1016/J.IPL.2008.03.011
Recommended article: Q4835609
Recommended article: Ehrenfeucht-Fraïssé games on ordinals
Recommended article: Q3509083
Recommended article: Games in finite model theory
Recommended article: Ehrenfeucht-Fraisse Games on Omega-Terms
Recommended article: Ehrenfeucht–Fraïssé Games on Linear Orders
Recommended article: Q3790976
Recommended article: Q4263796
Recommended article: On Complexity of Ehrenfeucht-Fraïssé Games
Recommended article: On complexity of Ehrenfeucht-Fraïssé games
description: scientific article; zbMATH DE number 5694993