Preservation and decomposition theorems for bounded degree structures
Logical Methods in Computer Science, Volume 11, Issue 4, 2014.
computational logicalgorithmspreservation theoremsexistential preservationhomomorphism preservationMore(10+)
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
PPT (Upload PPT)