Creative Commons Attribution 3.0 Unported license
A Boolean closed full trio is a class of languages that is closed under the Boolean operations (union, intersection, and complementation) and rational transductions. It is well-known that the regular languages constitute such a Boolean closed full trio. It is shown here that every such language class that contains any non-regular language already includes the whole arithmetical hierarchy (and even the one relative to this language). A consequence of this result is that aside from the regular languages, no full trio generated by one language is closed under complementation. Our construction also shows that there is a fixed rational Kripke frame such that assigning an arbitrary non-regular language to some variable allows the definition of any language from the arithmetical hierarchy in the corresponding Kripke structure using multimodal logic.
@InProceedings{lohrey_et_al:LIPIcs.STACS.2014.530,
author = {Lohrey, Markus and Zetzsche, Georg},
title = {{On Boolean closed full trios and rational Kripke frames}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {530--541},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.530},
URN = {urn:nbn:de:0030-drops-44853},
doi = {10.4230/LIPIcs.STACS.2014.530},
annote = {Keywords: rational transductions, full trios, arithmetical hierarchy, Boolean operations}
}