Database Paper Browser

Back to papers

Untyped Sets, Invention, and Computable Queries

Summary: Over untyped sets, set algebra without while is equivalent to the typed complex-object algebra; with while (or COL under stratified/inflationary semantics) it captures exactly the computable queries. Exhibits a calculus beyond computable queries, characterizes it via a typed complex-object calculus with invention, and introduces a "generic Turing machine" technical tool. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
879
Venue
PODS
Year
1989
Pagerank
8.6128871e-05
Overall Rank
2,515 | 82.51%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers