Definability of group theoretic notions Export

@misc{citeulike:1724567, abstract = {We consider logical definability of the group-theoretic notions of simplicity, nilpotency and solvability on the class of finite groups. On one hand, we show that these notions are definable by sentences of deterministic transitive closure logic DTC. These results are based on known group-theoretic results. On the other hand, we prove that simplicity, nilpotency and the normal closure of a subset of a group are not definable by single sentences of first order logic FO. In addition, we show that ...}, author = {Koponen, A. and Luosto, K.}, citeulike-article-id = {1724567}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.9486}, keywords = {complexity, fmt}, posted-at = {2007-10-03 17:08:46}, priority = {2}, title = {Definability of group theoretic notions}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.9486}, year = {2000} }

TY - GEN ID - citeulike:1724567 L3 - citeulike-article-id:1724567 N2 - We consider logical definability of the group-theoretic notions of simplicity, nilpotency and solvability on the class of finite groups. On one hand, we show that these notions are definable by sentences of deterministic transitive closure logic DTC. These results are based on known group-theoretic results. On the other hand, we prove that simplicity, nilpotency and the normal closure of a subset of a group are not definable by single sentences of first order logic FO. In addition, we show that ... TI - Definability of group theoretic notions KW - complexity KW - fmt AU - Koponen, A AU - Luosto, K PY - 2000/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.9486 ER -