@article{Makowsky2004159,
    Abstract = {The classical Feferman--Vaught Theorem for First Order Logic explains how to compute the truth value of a first order sentence in a generalized product of first order structures by reducing this computation to the computation of truth values of other first order sentences in the factors and evaluation of a monadic second order sentence in the index structure. This technique was later extended by L{\"a}uchli, Shelah and Gurevich to monadic second order logic. The technique has wide applications in decidability and definability theory. Here we give a unified presentation, including some new results, of how to use the Feferman--Vaught Theorem, and some new variations thereof, algorithmically in the case of Monadic Second Order Logic MSOL. We then extend the technique to graph polynomials where the range of the summation of the monomials is definable in MSOL. Here the Feferman--Vaught Theorem for these polynomials generalizes well known splitting theorems for graph polynomials. Again, these can be used algorithmically. Finally, we discuss extensions of \{MSOL\} for which the Feferman--Vaught Theorem holds as well.},
    Author = {Makowsky, J. A.},
    File = {Algorithmic uses of the Feferman–Vaught Theorem - Makowsky (0) (0) - a - a - y.pdf},
    ISSN = {0168-0072},
    Journal = {Annals of Pure and Applied Logic},
    Keywords = {Graph polynomials},
    Note = {Provinces of logic determined. Essays in the memory of Alfred Tarski. Parts I, \{II\} and \{III\}},
    Number = {1--3},
    Pages = {159 - 213},
    Title = {Algorithmic uses of the Feferman--Vaught Theorem},
    URL = {http://www.sciencedirect.com/science/article/pii/S0168007203001003},
    Volume = {126},
    Year = {2004},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0168007203001003},
    bdsk-url-2 = {http://dx.doi.org/10.1016/j.apal.2003.11.002},
    date-added = {2015-04-23 05:58:18 +0000},
    date-modified = {2015-04-23 05:58:18 +0000},
    doi = {10.1016/j.apal.2003.11.002}
}

@article{Makowsky2004159, Abstract = {The classical Feferman--Vaught Theorem for First Order Logic explains how to compute the truth value of a first order sentence in a generalized product of first order structures by reducing this computation to the computation of truth values of other first order sentences in the factors and evaluation of a monadic second order sentence in the index structure. This technique was later extended by L{\"a}uchli, Shelah and Gurevich to monadic second order logic. The technique has wide applications in decidability and definability theory. Here we give a unified presentation, including some new results, of how to use the Feferman--Vaught Theorem, and some new variations thereof, algorithmically in the case of Monadic Second Order Logic MSOL. We then extend the technique to graph polynomials where the range of the summation of the monomials is definable in MSOL. Here the Feferman--Vaught Theorem for these polynomials generalizes well known splitting theorems for graph polynomials. Again, these can be used algorithmically. Finally, we discuss extensions of {MSOL} for which the Feferman--Vaught Theorem holds as well.}, Author = {Makowsky, J. A.}, File = {Algorithmic uses of the Feferman–Vaught Theorem - Makowsky (0) (0) - a - a - y.pdf}, ISSN = {0168-0072}, Journal = {Annals of Pure and Applied Logic}, Keywords = {Graph polynomials}, Note = {Provinces of logic determined. Essays in the memory of Alfred Tarski. Parts I, {II} and {III}}, Number = {1--3}, Pages = {159 - 213}, Title = {Algorithmic uses of the Feferman--Vaught Theorem}, URL = {http://www.sciencedirect.com/science/article/pii/S0168007203001003}, Volume = {126}, Year = {2004}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0168007203001003}, bdsk-url-2 = {http://dx.doi.org/10.1016/j.apal.2003.11.002}, date-added = {2015-04-23 05:58:18 +0000}, date-modified = {2015-04-23 05:58:18 +0000}, doi = {10.1016/j.apal.2003.11.002} }