On the power of deterministic transitive closures

DOI10.1006/inco.1995.1081zbMath0832.68098OpenAlexW2036801664MaRDI QIDQ1893732

Erich Grädel, Gregory Loren McColm

Publication date: 1 August 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/aa908e28af98e7c54592022680faef4b473bd69b

zbMATH Keywords

transitive closure logic

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27)

Related Items (2)

A double arity hierarchy theorem for transitive closure logic ⋮ Pure Pointer Programs with Iteration

This page was built for publication: On the power of deterministic transitive closures