Model Theory Makes Formulas Large
From MaRDI portal
Publication:5428869
DOI10.1007/978-3-540-73420-8_78zbMath1171.03324OpenAlexW1780759614WikidataQ58215619 ScholiaQ58215619MaRDI QIDQ5428869
Nicole Schweikardt, Stephan Kreutzer, Anuj Dawar, Martin Grohe
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_78
Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Basic properties of first-order languages and structures (03C07)
Related Items (max. 100)
Effective Interpolation and Preservation in Guarded Logics ⋮ Feferman-vaught decompositions for prefix classes of first order logic ⋮ An optimal construction of Hanf sentences ⋮ Unnamed Item ⋮ A generalization of the Łoś-Tarski preservation theorem ⋮ Unnamed Item ⋮ The uniform measure of simple regular sets of infinite trees ⋮ Compositional Failure Detection in Structured Transition Systems ⋮ The parameterized complexity of \(k\)-edge induced subgraphs ⋮ The Complexity of Decomposing Modal and First-Order Theories ⋮ The Compositional Method and Regular Reachability
This page was built for publication: Model Theory Makes Formulas Large