Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T15:50:13.700Z Has data issue: false hasContentIssue false

The logic of recursive equations

Published online by Cambridge University Press:  12 March 2014

A. J. C. Hurkens
Affiliation:
Klaasstokseweg 7, 5443 NS HAPS, The Netherlands, E-mail: hurkens@sci.kun.nl
Monica McArthur
Affiliation:
Department of Mathematics, Indiana University, Bloomington IN 47405, USA, E-mail: mcarthur@iu-math.math.indiana.edu
Yiannis N. Moschovakis
Affiliation:
Department of Mathematics, University of California, Los Angeles, CA 90024, USA, E-mail: ynm@math.ucla.edu
Lawrence S. Moss
Affiliation:
Departments of Mathematics and Computer Science, Indiana University, Bloomington IN 47405, USA, E-mail: lmoss@ucs.indiana.edu
Glen T. Whitney
Affiliation:
Department of Mathematics, University of Michigan, Ann Arbor, MI 48109, USA, E-mail: glen@rentec.com

Abstract

We study logical systems for reasoning about equations involving recursive definitions. In particular, we are interested in “propositional” 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]. Our main focus here concerns the sharp contrast between the simple class of valid identities and the very complex consequence relation over several natural classes of models.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable