Preservation and decomposition theorems for bounded degree structures

    Logical Methods in Computer Science, Volume 11, Issue 4, 2014.

    Cited by: 8|Bibtex|Views5|Links
    EI
    Keywords:
    computational logicalgorithmspreservation theoremsexistential preservationhomomorphism preservationMore(10+)

    Abstract:

    We provide elementary algorithms for two preservation theorems forfirst-order sentences (FO) on the class ^ad of all finite structures of degreeat most d: For each FO-sentence that is preserved under extensions(homomorphisms) on ^ad, a ^ad-equivalent existential (existential-positive)FO-sentence can be constructed in 5-fold (4-fold) expon...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments