Destructive rule-based properties and first-order logic

DOI10.1007/978-3-642-11266-9_28MaRDI QIDQ3401103zbMATH OpenOpenAlexFDO

Authors David Duris

Publication date 28 January 2010

Published in SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11266-9_28

zbMATH Keywords

complexitydefinabilitydestructive rulefinite model theorymodel checking

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 4008383
• Parameterized complexity of elimination distance to first-order logic properties
• EDGE-DELETION GRAPH PROBLEMS WITH FIRST-ORDER EXPRESSIBLE SUBGRAPH PROPERTIES
• Universal first-order logic is superfluous for NL, P, NP and coNP
• Indistinguishability and First-Order Logic

This page was built for publication: Destructive rule-based properties and first-order logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401103)