Metafinite model theory
type: Item
instance of: scholarly article
title: Metafinite model theory
zbMATH Open document ID: 0892.68033
author: Erich Grädel
author: Yuri Gurevich
published in: Information and Computation
publication date: 1998-05-04T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03C13
Mathematics Subject Classification ID: 03C98
Mathematics Subject Classification ID: 68Q19
zbMATH DE Number: 1138509
zbMATH Keywords: metafinite structures
zbMATH Keywords: descriptive complexity
MaRDI profile type: Publication
full work available at URL: inco.1997.2675
OpenAlex ID: W2045916776
cites work: On Moschovakis closure ordinals
cites work: Q5691140
cites work: Extended order-generic queries
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Computable queries for relational data bases
cites work: Q4918393
cites work: Nonconvergence, undecidability, and intractability in asymptotic problems
cites work: Q4850061
cites work: Q4058132
cites work: Finite-model theory -- A personal perspective
cites work: 0-1 laws for recursive structures
cites work: Q4234078
cites work: Q4283240
cites work: Q3757929
cites work: Finitely representable databases
cites work: Q3758820
cites work: Evolving Algebras 1993: Lipari Guide
cites work: Fixed-point extensions of first-order logic
cites work: Completeness results for recursive data bases
cites work: A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets
cites work: Relational queries computable in polynomial time
cites work: Q3830533
cites work: Register machine proof of the theorem on exponential diophantine representation of enumerable sets
cites work: Handling infinite temporal data
cites work: Q4385543
cites work: An arithmetical characterization of NP
cites work: Almost sure theories
cites work: Q4286756
cites work: The expressive power of fixed-point logic with counting
cites work: Q4332930
cites work: Q4298260
cites work: Optimization, approximation, and complexity classes
cites work: Deux ou trois choses que je sais de Ln
cites work: Nonconvergence in the theory of random orders
cites work: Q4381423
cites work: The Complexity of Enumeration and Reliability Problems
DOI: 10.1006/INCO.1997.2675
description: scientific article; zbMATH DE number 1138509