The logic of recursive equations

Journal of Symbolic Logic 63 (2):451-478 (1998)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586843
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,793
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
13 ( #392,241 of 2,214,705 )

Recent downloads (6 months)
2 ( #239,058 of 2,214,705 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature