Sciweavers

LICS
1995
IEEE
14 years 4 months ago
Tree Canonization and Transitive Closure
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
Kousha Etessami, Neil Immerman