Metafinite model theory

DOI10.1007/3-540-60178-3_92MaRDI QIDQ6064289

Erich Grädel, Yuri Gurevich

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

conjunctive querypartial isomorphismdiscrete dynamic systemprimary partweight term

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets
• Fixed-point extensions of first-order logic
• Nonconvergence, undecidability, and intractability in asymptotic problems
• Computable queries for relational data bases
• An arithmetical characterization of NP
• Upper and lower bounds for first order expressibility
• Datalog extensions for database queries and updates
• Nonconvergence in the theory of random orders
• Optimization, approximation, and complexity classes
• Finitely representable databases
• Handling infinite temporal data
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• Relational queries computable in polynomial time
• Almost sure theories
• On Moschovakis closure ordinals
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Deux ou trois choses que je sais de L_n
• Evolving Algebras 1993: Lipari Guide
• The expressive power of fixed-point logic with counting

This page was built for publication: Metafinite model theory