Order-invariant types and their applications

From MaRDI portal
Publication:2800972

DOI10.2168/LMCS-12(1:9)2016zbMATH Open1448.03021arXiv1603.04309OpenAlexW2301245128MaRDI QIDQ2800972FDOQ2800972


Authors: Pablo Barceló, Leonid Libkin Edit this on Wikidata


Publication date: 19 April 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: Our goal is to show that the standard model-theoretic concept of types can be applied in the study of order-invariant properties, i.e., properties definable in a logic in the presence of an auxiliary order relation, but not actually dependent on that order relation. This is somewhat surprising since order-invariant properties are more of a combinatorial rather than a logical object. We provide two applications of this notion. One is a proof, from the basic principles, of a theorem by Courcelle stating that over trees, order-invariant MSO properties are expressible in MSO with counting quantifiers. The other is an analog of the Feferman-Vaught theorem for order-invariant properties.


Full work available at URL: https://arxiv.org/abs/1603.04309




Recommendations





Cited In (7)





This page was built for publication: Order-invariant types and their applications

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