Finite model theory and its applications.
From MaRDI portal
Publication:703863
zbMath1133.03001MaRDI QIDQ703863
Erich Grädel, Phokion G. Kolaitis, Marx Maarten, Moshe Y. Vardi, Scott Weinstein, Yde Venema, J. H. Spencer, Leonid O. Libkin
Publication date: 12 January 2005
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)
Related Items
A Logical Approach to Data-Aware Automated Sequence Generation, A logical approach to locality in pictures languages, On the Complexity of the Model Checking Problem, The mu-calculus and Model Checking, Unnamed Item, Choiceless Polynomial Time on Structures with Small Abelian Colour Classes, Deciding Parity Games in Quasi-polynomial Time, Tight lower and upper bounds for the complexity of canonical colour refinement, An Ehrenfeucht-Fraïssé game approach to collapse results in database theory, Descriptive complexity of deterministic polylogarithmic time and space, Computational Complexity Via Finite Types, Is Polynomial Time Choiceless?, A Dichotomy Result for Ramsey Quantifiers, Computation over algebraic structures and a classification of undecidable problems, First-order Logic with Connectivity Operators, Inductive definitions in logic versus programs of real-time cellular automata, Topological elementary equivalence of regular semi‐algebraic sets in three‐dimensional space, A simple logic of concepts, On the computation of zone and double zone diagrams, Coherence and computational complexity of quantifier-free dependence logic formulas, Characterizing polynomial Ramsey quantifiers, The Descriptive Complexity of Parity Games, RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!, About the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders: A New Study of Its Computability, Type extension trees for feature construction and learning in relational domains, On the complexity of team logic and its two-variable fragment, Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic, Some thoughts on knowledge-enhanced machine learning, The descriptive complexity of decision problems through logics with relational fixed-point and capturing results, Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs, Decomposing Quantified Conjunctive (or Disjunctive) Formulas, Unnamed Item, Unnamed Item, Unnamed Item, The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws, Unnamed Item, Unnamed Item, Consistent query answering for primary keys in Datalog, A game for linear-time-branching-time spectroscopy, Games for Inclusion Logic and Fixed-Point Logic, Two first-order logics of permutations, On Models of a Nondeterministic Computation, Choiceless Logarithmic Space, Fixed-Point Definability and Polynomial Time, From Hilbert's program to a logic tool box, The semijoin algebra and the guarded fragment, Unnamed Item, A Logical Approach to Constraint Satisfaction, Unnamed Item, Canonisation and Definability for Graphs of Bounded Rank Width
