NYU Faculty Digital Archive
metadata only
A TEMPORAL RELATIONAL ALGEBRA AS A BASIS FOR TEMPORAL RELATIONAL COMPLETENESS
We define a temporal algebra that is applicable to any temporal relational data model supporting discrete linear bounded time. This algebra has the five basic relational algebra operators extended to the temporal domain and an operator of linear recursion. We show that this algebra has the expr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Relational Representation Distillation#820149
- Relational Patterns#933403
- The Impossibility of an Infinite Future: Backward Traversal and Temporal Coherence#120941
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA#711696
- The Composition Lemma for $n$-dependence#821186
Record · ID 933514
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive