A short tutorial on order-invariant first-order logic

DOI10.1007/978-3-642-38536-0_10zbMATH Open1381.03027OpenAlexW125116438MaRDI QIDQ4928477FDOQ4928477

Authors: Nicole Schweikardt 

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_10

Recommendations

• On the expressive power of logics with invariant uses of arithmetic predicates
• Computer Science Logic
• Towards a characterization of order-invariant queries over tame graphs
• Expressivity and succinctness of order-invariant logics on depth-bounded structures
• Lower bounds for invariant queries in logics with counting.

Mathematics Subject Classification ID

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

Cited In (7)

• On the expressive power of logics with invariant uses of arithmetic predicates
• First-order definitions of subgraph isomorphism through the adjacency and order relations
• Title not available (Why is that?)
• Invited Talk: Coherentisation of First-Order Logic
• The descriptive complexity of subgraph isomorphism without numerics
• Order-invariant types and their applications
• On the locality of arb-invariant first-order formulas with modulo counting quantifiers

This page was built for publication: A short tutorial on order-invariant first-order logic

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