Finitely representable databases
type: Item
instance of: scholarly article
title: Finitely representable databases
zbMATH Open document ID: 0887.68023
author: Stéphane Grumbach
author: Jianwen Su
published in: Journal of Computer and System Sciences
publication date: 1997-12-17T00:00:00Z
full work available at URL: 97jcss-grumbach-su.pdf
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1097808
zbMATH Keywords: relational databases
zbMATH Keywords: finitely representable databases
MaRDI profile type: Publication
OpenAlex ID: W2037381552
cites work: Q4864249
cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures
cites work: Datalog extensions for database queries and updates
cites work: The complexity of elementary algebra and geometry
cites work: Computable queries for relational data bases
cites work: Structure and complexity of relational queries
cites work: Model theory
cites work: A relational model of data for large shared data banks
cites work: Q4079605
cites work: Q4918393
cites work: The elementary theory of restricted analytic fields with exponentiation
cites work: Q3220545
cites work: An application of games to the completeness problem for formalized theories
cites work: Q4052071
cites work: Probabilities on finite models
cites work: Finite-model theory -- A personal perspective
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: Q3666827
cites work: Metafinite model theory
cites work: Completeness results for recursive data bases
cites work: On the expressive power of database queries with intermediate types
cites work: Algebraic and calculus query languages for recursively typed complex objects
cites work: Domain independence and the relational calculus
cites work: Relative Information Capacity of Simple Relational Database Schemata
cites work: Relational queries computable in polynomial time
cites work: Languages that Capture Complexity Classes
cites work: Q4490722
cites work: Indexing for data models with constraints and classes
cites work: Q4694690
cites work: First-Order Queries on Finite Structures Over the Reals
cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
cites work: Q4694689
cites work: Q5807665
cites work: Q5797034
cites work: Q3347338
cites work: Sentences true in all constructive models
cites work: Q4385512
DOI: 10.1006/JCSS.1997.1524
Recommended article: Q4353560
Recommended article: Q4026906
Recommended article: Algebraic Databases
Recommended article: On the decidability and axiomatization of query finiteness in deductive databases
Recommended article: Databases over a fixed infinite universe
Recommended article: Extremal theorems for databases
Recommended article: Q4472218
Recommended article: An Algebraic Theory of Relational Databases
Recommended article: Q3805888
Recommended article: Q4249219
description: scientific article; zbMATH DE number 1097808