Antonius J. C. Hurkens

Learn More
We study logical systems for reasoning about equations involving recursive deenitions. In particular, we are interested in propositionall fragments of the functional language of recursion FLR 18, 17], i.e., without the value passing or abstraction allowed in FLR. The pure, propositional fragment FLR0 turns out to coincide with the iteration theories of 1].(More)
  • 1