Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394583zbMATH OpenOpenAlexFDO

Authors Michael Benedikt, Luc Segoufin

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Model theory of finite structures (03C13) Database theory (68P15)

Recommendations

• Towards a characterization of order-invariant queries over tame graphs
• Order invariance on decomposable structures
• Expressivity and succinctness of order-invariant logics on depth-bounded structures
• Lower bounds for invariant queries in logics with counting.
• Succinctness of Order-Invariant Logics on Depth-Bounded Structures

Cited in

(14)

• Normalizable linear orders and generic computations in finite models
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Order-invariant types and their applications
• Cofinality relation, pre-orders and orders, semantics of ORDER BY clause of querics in SQL-like language
• On the expressive power of logics with invariant uses of arithmetic predicates
• Expressivity and succinctness of order-invariant logics on depth-bounded structures
• On the ordered conjecture
• Towards a characterization of order-invariant queries over tame graphs
• scientific article; zbMATH DE number 1088200 (Why is no real title available?)
• Order invariance on decomposable structures
• scientific article; zbMATH DE number 1848311 (Why is no real title available?)
• Order-invariant MSO is stronger than counting MSO in the finite
• A short tutorial on order-invariant first-order logic
• scientific article; zbMATH DE number 1392296 (Why is no real title available?)

This page was built for publication: Computer Science Logic

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