@inbook{Bojanczyk2012,
Abstract = {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.},
Address = {Berlin, Heidelberg},
Author = {Boja{\'{n}}czyk, Miko{{\l}}aj and Place, Thomas},
BookTitle = {Automata, Languages, and Programming: 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II},
Editor = {Czumaj, Artur and Mehlhorn, Kurt and Pitts, Andrew and Wattenhofer, Roger},
File = {conficalpBojanczykP12a (0) - a - a - h.pdf},
ISBN = {978-3-642-31585-5},
Pages = {116--127},
Publisher = {Springer Berlin Heidelberg},
Title = {Toward Model Theory with Data Values},
URL = {https://doi.org/10.1007/978-3-642-31585-5\_14},
Year = {2012},
bdsk-url-1 = {https://doi.org/10.1007/978-3-642-31585-5\_14},
date-added = {2017-12-30 17:34:56 +0000},
date-modified = {2017-12-30 17:34:56 +0000},
doi = {10.1007/978-3-642-31585-5_14}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 07:51:09,
Build Time: N/A