First-Order Queries on Finite Structures Over the Reals
From MaRDI portal
Publication:4210130
DOI10.1137/S009753979629766zbMath0907.68062OpenAlexW2028588210MaRDI QIDQ4210130
Jan Van den Bussche, Jan Paredaens, Dirk Van Gucht
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753979629766
Database theory (68P15) Model theory of finite structures (03C13) Basic properties of first-order languages and structures (03C07) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (12)
A representation independent language for planar spatial databases with Euclidean distance ⋮ Finitely representable databases ⋮ Queries with arithmetical constraints ⋮ Reachability and connectivity queries in constraint databases ⋮ Linear constraint query languages expressive power and complexity ⋮ The past and future of embedded finite model theory ⋮ Aggregate operators in constraint query languages ⋮ On the expressiveness of linear-constraint query languages for spatial databases ⋮ Ehrenfeucht-Fraïssé goes automatic for real addition ⋮ A collapse result for constraint queries over structures of small degree ⋮ A technique for proving decidability of containment and equivalence of linear constraint queries ⋮ Stability theory, permutations of indiscernibles, and embedded finite models
This page was built for publication: First-Order Queries on Finite Structures Over the Reals
