On the ordered conjecture

DOI10.1109/LICS.2012.33MaRDI QIDQ2986799zbMATH OpenOpenAlexFDO

Authors Yijia Chen, Jörg Flum

Publication date 16 May 2017

Published in 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2012.33

zbMATH Keywords

cliquewidthleast fixed-point logicordered conjecturetreewidth

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Recommendations

• Infinitary logic and inductive definability over finite structures
• The expressive power of finitely many generalized quantifiers
• Towards a characterization of order-invariant queries over tame graphs
• Model-checking on ordered structures
• Computer Science Logic

Cited in

(14)

• Normalizable linear orders and generic computations in finite models
• Order shattering and Wilson's theorem
• On Todorcevic orderings
• Bounded treewidth and space-efficient linear algebra
• ON THE DEFINITION OF ORDERED n‐TUPLES
• scientific article; zbMATH DE number 1139370 (Why is no real title available?)
• An Ordering on the Even Discrete Torus
• scientific article; zbMATH DE number 1414308 (Why is no real title available?)
• Tameness in least fixed-point logic and McColm's conjecture
• The Treewidth and Pathwidth of Graph Unions
• First order logic, fixed point logic and linear order
• Tangled paths: a random graph model from Mallows permutations (extended abstract)
• The order conjecture fails in S
• Consequences and conjectures in preordered sets

This page was built for publication: On the ordered conjecture

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