Thomas Place ; Luc Segoufin - Deciding definability in FO2(<h,<v) on trees

lmcs:1581 - Logical Methods in Computer Science, September 1, 2015, Volume 11, Issue 3 - https://doi.org/10.2168/LMCS-11(3:5)2015
Deciding definability in FO2(<h,<v) on treesArticle

Authors: Thomas Place ; Luc Segoufin

    We provide a decidable characterization of regular forest languages definable in FO2(

    https://doi.org/10.2168/LMCS-11(3:5)2015
    Source: arXiv.org:1505.04934
    Volume: Volume 11, Issue 3
    Published on: September 1, 2015
    Imported on: October 11, 2013
    Keywords: Computer Science - Logic in Computer Science
    Licence: arXiv.org - Non-exclusive license to distribute

    Share and export

    Consultation statistics

    This page has been seen 2019 times.
    This article's PDF has been downloaded 391 times.