Counting and Addition Cannot Express Deterministic Transitive Closure

Matthias Ruhl. Counting and Addition Cannot Express Deterministic Transitive Closure. In Proceedings, 14th Annual IEEE Symposium on Logic in Computer Science, 2-5 July, 1999, Trento, Italy. pages 326-334, IEEE Computer Society, 1999. [doi]

@inproceedings{Ruhl99,
  title = {Counting and Addition Cannot Express Deterministic Transitive Closure},
  author = {Matthias Ruhl},
  year = {1999},
  url = {http://computer.org/conferen/proceed/lics/0158/01580326abs.htm},
  researchr = {https://researchr.org/publication/Ruhl99},
  cites = {0},
  citedby = {0},
  pages = {326-334},
  booktitle = {Proceedings, 14th Annual IEEE Symposium on Logic in Computer Science, 2-5 July, 1999, Trento, Italy},
  publisher = {IEEE Computer Society},
}