Computer Science Logic
From MaRDI portal
Publication:5292639
DOI10.1007/b13224zbMath1116.03327MaRDI QIDQ5292639
Nicole Schweikardt, Martin Grohe
Publication date: 21 June 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13224
Succinctness; \(\mu\)-Calculus; Monadic Second-Order Logic; Finite Model Theory; Fixed-Point Logics; Monadic Datalog; Tree-like structures
68P15: Database theory
03B70: Logic in computer science
03C13: Model theory of finite structures
68Q19: Descriptive complexity and finite models
Related Items
Comparing the succinctness of monadic query languages over finite trees, Automata for XML -- a survey, Weighted monadic Datalog, Communicating Finite-State Machines and Two-Variable Logic