A collapse result for constraint queries over structures of small degree

DOI10.1016/S0020-0190(02)00508-2zbMath1162.68418OpenAlexW2086251587MaRDI QIDQ1007620

Leonid O. Libkin

Publication date: 23 March 2009

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00508-2

zbMATH Keywords

databasesconstraint query languagescollapse resultsembedded finite models

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

An Ehrenfeucht-Fraïssé game approach to collapse results in database theory

Cites Work

• Classification theory and the number of non-isomorphic models.
• A decision procedure for term algebras with queues
• First-Order Queries on Finite Structures Over the Reals
• Pseudo-finite homogeneity and saturation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A collapse result for constraint queries over structures of small degree