Ehrenfeucht--Fraïssé games in finite set theory

Authors:
Xiang Zhou
Affiliations:
Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100190, China and Graduate School of the Chinese Academy of Sciences, 19 Yuquan Street, B ...
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 0

Modal logic

Modal logic
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Counting and Addition cannot Express Deterministic Transitive Closure

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Fixed-point logics, descriptive complexity, and random satisfiability

Fixed-point logics, descriptive complexity, and random satisfiability
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Arithmetic, first-order logic, and counting quantifiers

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this article, with Ehrenfeucht-Fraisse games we prove that @D"1@D"0 on BFR, which implies @D@D"0 on BFR, and thus solve an open problem raised by Albert Atserias in his dissertation (@D"0,@D"1,@D are fragments of first order logic and BFR is a class of finite sets which in essence is equivalent to a class of finite pure arithmetic structures with built-in BIT predicate).