In:
The Journal of Symbolic Logic, Cambridge University Press (CUP), Vol. 63, No. 2 ( 1998-06), p. 451-478
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 FLR 0 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.
Type of Medium:
Online Resource
ISSN:
0022-4812
,
1943-5886
Language:
English
Publisher:
Cambridge University Press (CUP)
Publication Date:
1998
detail.hit.zdb_id:
3077-6
detail.hit.zdb_id:
2010607-5
SSG:
5,1
SSG:
17,1
