Definability over linear constraints

DOI10.1007/3-540-44622-2_14MaRDI QIDQ2753675zbMATH OpenFDO

Authors Michael Benedikt, H. Jerome Keisler

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44622-2_14

Mathematics Subject Classification ID

Logic in computer science (03B70) Database theory (68P15)

Recommendations

• Definability with a predicate for a semi-linear set
• On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
• Linear-constraint databases
• Queries with arithmetical constraints
• On the expressiveness of linear-constraint query languages for spatial databases

Cited in

(6)

• On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
• On the orthographic dimension of definable sets
• Definability with a predicate for a semi-linear set
• Linear-constraint databases
• scientific article; zbMATH DE number 1420799 (Why is no real title available?)
• Definability with bounded number of bound variables

This page was built for publication: Definability over linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753675)