First-order queries on databases embedded in an infinite structure
type: Item
instance of: scholarly article
title: First-order queries on databases embedded in an infinite structure
zbMATH Open document ID: 0875.68356
DOI: 10.1016/S0020-0190(96)00140-8
author: Martin Otto
author: Jan Van den Bussche
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 983853
zbMATH Keywords: Databases
zbMATH Keywords: Relational databases
zbMATH Keywords: Query
zbMATH Keywords: First-order logic
zbMATH Keywords: Model theory
MaRDI profile type: Publication
cites work: Properties of almost all graphs and complexes
cites work: Computable queries for relational data bases
cites work: Model theory.
cites work: Q4850061
cites work: Q4003410
cites work: Definable Sets in Ordered Structures. I
cites work: Classifying regular events in symbolic logic
full work available at URL: s0020-0190(96)00140-8
OpenAlex ID: W2024386384
Recommended article: First-Order Queries on Finite Structures Over the Reals
Recommended article: Q5109514
Recommended article: Q5094135
Recommended article: On compiling queries in recursive first-order databases
Recommended article: Database Theory - ICDT 2005
Recommended article: First-order query rewriting for inconsistent databases
Recommended article: The complexity of querying indefinite data about linearly ordered domains
Recommended article: Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
Recommended article: The Tractability Frontier of Graph-Like First-Order Query Sets
Recommended article: The tractability frontier of graph-like first-order query sets
description: scientific article; zbMATH DE number 983853