Finite model theory and its applications.
From MaRDI portal
Publication:703863
zbMATH Open1133.03001MaRDI QIDQ703863FDOQ703863
Authors: Erich Grädel, Phokion G. Kolaitis, Marx Maarten, Moshe Y. Vardi, Yde Venema, Scott Weinstein, Leonid Libkin, Joel Spencer 
Publication date: 12 January 2005
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1324669
- Elements of finite model theory.
- Finite Model Theory
- scientific article; zbMATH DE number 803291
- scientific article; zbMATH DE number 176207
- Some Aspects of Model Theory and Finite Structures
- scientific article; zbMATH DE number 2156368
- scientific article; zbMATH DE number 5038454
- Application of a Tauberian theorem to finite model theory
- Finite mathematics. Models and applications
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)
Cited In (68)
- Two first-order logics of permutations
- Deciding Parity Games in Quasi-polynomial Time
- The Descriptive Complexity of Parity Games
- A Logical Approach to Constraint Satisfaction
- A dichotomy result for Ramsey quantifiers
- Characterizing polynomial Ramsey quantifiers
- Title not available (Why is that?)
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- Title not available (Why is that?)
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Is polynomial time choiceless?
- Computation over algebraic structures and a classification of undecidable problems
- Elements of finite model theory.
- A simple logic of concepts
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results
- Games for inclusion logic and fixed-point logic
- A general condition for collapse results
- Computational Complexity Via Finite Types
- A logical approach to locality in pictures languages
- Rank logic is dead, long live rank logic!
- On the complexity of the model checking problem
- Title not available (Why is that?)
- Finite Model Theory on Tame Classes of Structures
- A finite-model-theoretic view on propositional proof complexity
- Topological elementary equivalence of regular semi-algebraic sets in three-dimensional space
- Defining recursive predicates in graph orders
- Finite Model Theory
- Consistent query answering for primary keys in Datalog
- The mu-calculus and Model Checking
- Title not available (Why is that?)
- A game for linear-time-branching-time spectroscopy
- String-to-string interpretations with polynomial-size output
- On Models of a Nondeterministic Computation
- From Hilbert's program to a logic tool box
- On the computation of zone and double zone diagrams
- Canonisation and Definability for Graphs of Bounded Rank Width
- Title not available (Why is that?)
- Title not available (Why is that?)
- Choiceless Logarithmic Space
- Some thoughts on knowledge-enhanced machine learning
- Type extension trees for feature construction and learning in relational domains
- Title not available (Why is that?)
- Quirky quantifiers: optimal models and complexity of computation tree logic
- Some Aspects of Model Theory and Finite Structures
- Coherence and computational complexity of quantifier-free dependence logic formulas
- A logical approach to data-aware automated sequence generation
- The semijoin algebra and the guarded fragment
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
- Fixed-Point Definability and Polynomial Time
- Descriptive complexity of deterministic polylogarithmic time and space
- About the temporal logic of the lexicographic products of unbounded dense linear orders: a new study of its computability
- Title not available (Why is that?)
- On the complexity of team logic and its two-variable fragment
- Choiceless polynomial time on structures with small abelian colour classes
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
- Title not available (Why is that?)
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
- On the descriptive complexity of temporal constraint satisfaction problems
- A logical limit law for \(231\)-avoiding permutations
- Logical characterizations of algebraic circuit classes over integral domains
- First-order Logic with Connectivity Operators
- Spectrum of FO logic with quantifier depth 4 is finite
- Finite model theory
- Inductive definitions in logic versus programs of real-time cellular automata
This page was built for publication: Finite model theory and its applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703863)
