We define a variant of first-order logic that deals with data words, data trees, data graphs etc. The definition of the logic is based on Fraenkel-Mostowski sets (FM sets, also known as nominal sets). The key idea is that we allow infinite disjunction (and conjunction), as long as the set of disjuncts (conjunct) is finite modulo renaming of data values. We study model theory for this logic; in particular we prove that the infinite disjunction can be eliminated from formulas. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bojańczyk, M., & Place, T. (2012). Toward model theory with data values. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7392 LNCS, pp. 116–127). Springer Verlag. https://doi.org/10.1007/978-3-642-31585-5_14
Mendeley helps you to discover research relevant for your work.