On the Expressive Power of Logics on Finite Models Export

@misc{Kolaitis2003, abstract = {Structures" [Mos74], where they are called inductive relations. It should also be pointed out that in Immerman's book on "Descriptive Complexity" LFP is denoted by FO(LFP) (the closure of FO under least fixed-points) and LFP 1 is denoted by LFP(FO) (least fixed-points of first-order formulas).}, author = {Kolaitis, Phokion G.}, citeulike-article-id = {1746774}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.965}, keywords = {complexity, confirmation, model\_theory, transfer}, posted-at = {2007-10-09 19:23:48}, priority = {2}, title = {On the Expressive Power of Logics on Finite Models}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.965}, year = {2003} }

TY - GEN ID - Kolaitis2003 L3 - citeulike-article-id:1746774 N2 - Structures" [Mos74], where they are called inductive relations. It should also be pointed out that in Immerman's book on "Descriptive Complexity" LFP is denoted by FO(LFP) (the closure of FO under least fixed-points) and LFP 1 is denoted by LFP(FO) (least fixed-points of first-order formulas). TI - On the Expressive Power of Logics on Finite Models KW - complexity KW - confirmation KW - model_theory KW - transfer AU - Kolaitis, Phokion PY - 2003/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.965 ER -