On Lk(Q) Types and Boundedness of IFP(Q) on Finite Structures

Authors:
Anil Seth
Affiliations:
-
Venue:
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Year:
1999

Citing 5
Cited 0

Feasible computation through model theory

Feasible computation through model theory
The expressive power of finitely many generalized quantifiers

Information and Computation
Logical hierarchies in PTIME

Information and Computation
On the expressive power of variable-confined logics

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Ordering Finite Variable Types with Generalized Quantifiers

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that there is a class C of finite structures and a PTIME quantifier Q such that (1) IFP(Q) is bounded on C but L∞,ωω(Q) ≠ PFP(Q) ≠ IFP(Q) = FO(Q) over C. (2) For all k ≥ 2, IFPk(Q) is bounded but not uniformly bounded over C. (IFPk(Q) denotes the k-variable fragment of IFP(Q)) (3) For all k ≥ 2, IFPk(Q) is not uniformly bounded over C but IFPk(Q) = Lk(Q) over C.