Computer Science Logic

DOI10.1007/b13224zbMath1116.03327OpenAlexW2623947920MaRDI 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

zbMATH Keywords

Succinctness\(\mu\)-CalculusMonadic Second-Order LogicFinite Model TheoryFixed-Point LogicsMonadic DatalogTree-like structures

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (4)

Automata for XML -- a survey ⋮ Communicating Finite-State Machines and Two-Variable Logic ⋮ Weighted monadic Datalog ⋮ Comparing the succinctness of monadic query languages over finite trees

This page was built for publication: Computer Science Logic