Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Paper
Datalog vs first-order logic
Abstract
Our main result is that every datalog query expressible in first-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for finite structures. In addition, we give some counter-examples delimiting the main result. © 1994 by Academic Press, Inc.
Related
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
James Lee Hafner
Journal of Number Theory