Article contents
The dimension of the negation of transitive closure
Published online by Cambridge University Press: 12 March 2014
Abstract
We prove that any positive elementary (least fixed point) induction expressing the negation of transitive closure on finite nondirected graphs requires at least two recursion variables.
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1995
References
REFERENCES
- 3
- Cited by