First-order queries on databases embedded in an infinite structure

DOI10.1016/S0020-0190(96)00140-8zbMath0875.68356OpenAlexW2024386384MaRDI QIDQ1350000

Jan Van den Bussche, Martin Otto

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00140-8

zbMATH Keywords

DatabasesModel theoryFirst-order logicQueryRelational databases

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (3)

An Ehrenfeucht-Fraïssé game approach to collapse results in database theory ⋮ Extended order-generic queries ⋮ Stability theory, permutations of indiscernibles, and embedded finite models

Cites Work

• Unnamed Item
• Unnamed Item
• Computable queries for relational data bases
• Classifying regular events in symbolic logic
• Model theory.
• Properties of almost all graphs and complexes
• Definable Sets in Ordered Structures. I

This page was built for publication: First-order queries on databases embedded in an infinite structure