DBScholar

Back to papers

Expressibility of Bounded-Arity Fixed-Point Query Hierarchies

Summary: Proves strict bounded-arity hierarchies for FO with fixed-point operators: allowing predicate-variables of arity k+1 strictly increases the set of definable k-ary queries versus arity k. Also separates operators at each arity: k-ary IFP > LFP and k-ary GFP > IFP. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
876
Venue
PODS
Year
1989
Pagerank
-
Overall Rank
14,423 | 1.05%
DOI
10.1145/73721.73753

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{dubhashi_pods89,
        address = {New York, NY, USA},
        series = {{PODS} '89},
        title = {{Expressibility of Bounded-Arity Fixed-Point Query Hierarchies}},
        url = {https://dl.acm.org/doi/10.1145/73721.73753},
        doi = {10.1145/73721.73753},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Dubhashi, Pratul and Maheshwari, S. N.},
        year = {1989}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers